Advertisement

Practical Indexing XML Document for Twig Query

  • Hongzhi Wang
  • Wei Wang
  • Jianzhong Li
  • Xuemin Lin
  • Reymond Wong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3818)

Abstract

Answering structural queries of XML with index is an important approach of efficient XML query processing. Among existing structural indexes for XML data, F&B index is the smallest index that can answer all branching queries. However, an F&B index for less regular XML data often contains a large number of index nodes, and hence a large amount of main memory. If the F&B index cannot be accommodated in the available memory, its performance will degrade significantly. This issue has practically limited wider application of the F&B index.

In this paper, we propose a disk organization method for the F&B index which shift part of the leave nodes in the F&B index to the disk and organize them judiciously on the disk. Our method is based on the observation that the majority of the nodes in a F&B index is often the leaf nodes, yet their access frequencies are not high.

We select some leaves to output to disk. With the support of reasonable storage structure in main memory and in disk, we design efficient query processing method). We further optimize the design of the F&B index based on the query workload . Experimental results verified the effectiveness of our proposed approach.

Keywords

Leaf Node Query Processing Main Memory Index Node Path Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chung, C.-W., Min, J.-K., Shim, K.: Apex: an adaptive path index for XML data. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD 2002), pp. 121–132 (2002)Google Scholar
  2. 2.
    Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB 1997), pp. 436–445 (1997)Google Scholar
  3. 3.
    He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), Boston, MA, USA, March 2004, pp. 683–694 (2004)Google Scholar
  4. 4.
    Jiang, H., Lu, H., Wang, W., Ooi, B.C.: Xr-Tree: Indexing Xml Data For Efficient Structural Join. In: Proceedings of the 19th International Conference on Data Engineering (ICDE 2003), pp. 253–263 (2003)Google Scholar
  5. 5.
    Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering Indexes For Branching Path Queries. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD 2002), pp. 133–144 (2002)Google Scholar
  6. 6.
    Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity For Efficient Indexing Of Paths In Graph Structured Data. In: Proceedings of the 18th International Conference on Data Engineering (ICDE 2002), San Jose, CA, USA, March 2002, pp. 129–140 (2002)Google Scholar
  7. 7.
    McHugh, J., Widom, J.: Query Optimization For XML. In: Proceedings of 25th International Conference on Very Large Data Bases (VLDB 1999), pp. 315–326 (1999)Google Scholar
  8. 8.
    Milo, T., Suciu, D.: Index Structures For Path Expressions. In: Proceedings of the 7th International Conference on Database Theory (ICDE 1999), pp. 277–295 (1999)Google Scholar
  9. 9.
    Qun, C., Lim, A., Ong, K.W.: D(K)-Index: An Adaptive Structural Summary For Graph-Structured Data. In: The 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003), San Diego, California, USA, June 2003, pp. 134–144 (2003)Google Scholar
  10. 10.
    Ramanan, P.: Covering indexes for XML queries: Bisimulation - Simulation = Negation. In: Proceedings of 29th International Conference on Very Large Data Bases (VLDB 2003), pp. 165–176 (2003)Google Scholar
  11. 11.
    Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark for XML data management. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB 2002), pp. 974–985 (2002)Google Scholar
  12. 12.
    W3C. XML Query 1.0 and XPath 2.0 data model (2003), Available from http://www.w3.org/TR/xpath-datamodel/

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hongzhi Wang
    • 1
  • Wei Wang
    • 2
    • 3
  • Jianzhong Li
    • 1
  • Xuemin Lin
    • 2
    • 3
  • Reymond Wong
    • 2
  1. 1.Harbin Institute of TechnologyHarbinChina
  2. 2.University of New South WalesAustralia
  3. 3.National ICT of AustraliaAustralia

Personalised recommendations