At the moment most of index structures and query algorithms for XML documents are constructed on region-based numbering scheme. However this numbering scheme suffers from some drawbacks. In this paper, a novel and efficient numbering scheme is presented, which combines the label path information and data path information, and it can efficiently support all kinds of queries. Properties of this numbering scheme are discussed in detail. Query algorithms based an index structure, named HiD, are introduced. At last, comprehensive experiments are conducted to demonstrate the efficiency of our query algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Han, Z., & Fu, N. (2005). Efficiently coding and querying XML document. In Lecture Notes in Computer Science (Vol. 3433, pp. 54–69). Springer Verlag. https://doi.org/10.1007/978-3-540-31970-2_4
Mendeley helps you to discover research relevant for your work.