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

Jaehyung Lee, Yon Dohn Chung, Myoung Ho Kim

Research output: Chapter in Book/Report/Conference proceedingChapter

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
Title of host publicationProceedings of the International Database Engineering and Applications Symposium, IDEAS
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages393-397
Number of pages5
Publication statusPublished - 2000 Jan 1
Externally publishedYes
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

Fingerprint

Query processing

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Lee, J., Chung, Y. D., & Kim, M. H. (2000). Path query reduction and diffusion for distributed semi-structured data retrieval. In Proceedings of the International Database Engineering and Applications Symposium, IDEAS (pp. 393-397). Piscataway, NJ, United States: IEEE.

Path query reduction and diffusion for distributed semi-structured data retrieval. / Lee, Jaehyung; Chung, Yon Dohn; Kim, Myoung Ho.

Proceedings of the International Database Engineering and Applications Symposium, IDEAS. Piscataway, NJ, United States : IEEE, 2000. p. 393-397.

Research output: Chapter in Book/Report/Conference proceedingChapter

Lee, J, Chung, YD & Kim, MH 2000, Path query reduction and diffusion for distributed semi-structured data retrieval. in Proceedings of the International Database Engineering and Applications Symposium, IDEAS. IEEE, Piscataway, NJ, United States, pp. 393-397, 2000 International Database Engineering and Applications Symposium, Yokohama, Jpn, 00/9/18.
Lee J, Chung YD, Kim MH. Path query reduction and diffusion for distributed semi-structured data retrieval. In Proceedings of the International Database Engineering and Applications Symposium, IDEAS. Piscataway, NJ, United States: IEEE. 2000. p. 393-397
Lee, Jaehyung ; Chung, Yon Dohn ; Kim, Myoung Ho. / Path query reduction and diffusion for distributed semi-structured data retrieval. Proceedings of the International Database Engineering and Applications Symposium, IDEAS. Piscataway, NJ, United States : IEEE, 2000. pp. 393-397
@inbook{e2569b78840a4bc89f350148d566ac6a,
title = "Path query reduction and diffusion for distributed semi-structured data retrieval",
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.",
author = "Jaehyung Lee and Chung, {Yon Dohn} and Kim, {Myoung Ho}",
year = "2000",
month = "1",
day = "1",
language = "English",
pages = "393--397",
booktitle = "Proceedings of the International Database Engineering and Applications Symposium, IDEAS",
publisher = "IEEE",

}

TY - CHAP

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

AU - Lee, Jaehyung

AU - Chung, Yon Dohn

AU - Kim, Myoung Ho

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033697271&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033697271&partnerID=8YFLogxK

M3 - Chapter

SP - 393

EP - 397

BT - Proceedings of the International Database Engineering and Applications Symposium, IDEAS

PB - IEEE

CY - Piscataway, NJ, United States

ER -