A Multi-Level Inverted Index Technique for Structural Document Search


The KIPS Transactions:PartB , Vol. 15, No. 4, pp. 355-364, Aug. 2008
10.3745/KIPSTB.2008.15.4.355,   PDF Download:

Abstract

In general, we can use an inverted index for retrieving element lists from structured documents. An inverted index can retrieve a list of elements that have the same tag name. In this approach, however, the cost of query processing is linear to the length of a path query because all the structural relationships (parent-child and ancestor-descendant) should be resolved by structural join operations. In this paper, we propose an inverted index technique and a novel structural join technique for accelerating XML path query evaluation.Our inverted index can retrieve element lists for path segments in a parent-child relationship. Our structural join technique can handle lists of element pairs while the existing techniques handle lists of elements. We show through experiments that these two proposed techniques are integrated to accelerate evaluation of XML path queries.


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]
J. I. Kim, "A Multi-Level Inverted Index Technique for Structural Document Search," The KIPS Transactions:PartB , vol. 15, no. 4, pp. 355-364, 2008. DOI: 10.3745/KIPSTB.2008.15.4.355.

[ACM Style]
Jong Ik Kim. 2008. A Multi-Level Inverted Index Technique for Structural Document Search. The KIPS Transactions:PartB , 15, 4, (2008), 355-364. DOI: 10.3745/KIPSTB.2008.15.4.355.