Path query reduction and diffusion for distributed semi-structured data retrieval

Jaehyung Lee, Yon Dohn Chung, Myoung Ho Kim

Research output: Contribution to conferencePaper

Abstract

In this paper, we address the problem of query processing on distributed semi-structured data. The distributed semi-structured data can be modeled as a rooted and edge-labeled graph, where nodes are located in a single or a number of sites. For efficient retrieval of distributed semi-structured data, we propose a query processing model that is based on the `query reduction and diffusion' method. In the method, a user query is reduced in a site and distributed to other sites for data retrieval. We also propose a set of algorithms for the proposed model.

Original languageEnglish
Pages393-397
Number of pages5
Publication statusPublished - 2000
Event2000 International Database Engineering and Applications Symposium - Yokohama, Jpn
Duration: 2000 Sep 182000 Sep 20

Other

Other2000 International Database Engineering and Applications Symposium
CityYokohama, Jpn
Period00/9/1800/9/20

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Path query reduction and diffusion for distributed semi-structured data retrieval'. Together they form a unique fingerprint.

  • Cite this

    Lee, J., Chung, Y. D., & Kim, M. H. (2000). Path query reduction and diffusion for distributed semi-structured data retrieval. 393-397. Paper presented at 2000 International Database Engineering and Applications Symposium, Yokohama, Jpn, .