A Way to Speed up Evaluation of Path-oriented Queries using An Abbreviation-paths and An Extendible Hashing Technique


The KIPS Transactions:PartD, Vol. 11, No. 7, pp. 1409-1416, Dec. 2004
10.3745/KIPSTD.2004.11.7.1409,   PDF Download:

Abstract

Recently, due to the popularity and explosive growth of the Internet, information exchange is increasing dramatically over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet, so that retrieving the XML document, the problem for speeding up evaluation for path-oriented queries is a main issue. In this paper, we propose a new indexing technique to advance the searching performance of path-oriented queries in document databases, In the new indexing technique, an abbreviation-path file to perform path-oriented queries efficiently is generated which is able to use its hash-code value to index keys. Also this technique can be further enganced by combining the Extendible Hashing technique with the abbreviation-path file to expedite a speed up evaluation of retrieval.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. S. Park and W. H. Cho, "A Way to Speed up Evaluation of Path-oriented Queries using An Abbreviation-paths and An Extendible Hashing Technique," The KIPS Transactions:PartD, vol. 11, no. 7, pp. 1409-1416, 2004. DOI: 10.3745/KIPSTD.2004.11.7.1409.

[ACM Style]
Hee Sook Park and Woo Hyun Cho. 2004. A Way to Speed up Evaluation of Path-oriented Queries using An Abbreviation-paths and An Extendible Hashing Technique. The KIPS Transactions:PartD, 11, 7, (2004), 1409-1416. DOI: 10.3745/KIPSTD.2004.11.7.1409.