An Efficient Path Index for Querying Semi-structured Data

(Extended Abstract)
  • Michael Barg
  • Raymond K. Wong
  • Franky Lam
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2642)

Abstract

The richness of semi-structured data allows data of varied and inconsistent structures to be stored in a single database. Such data can be represented as a graph, and queries can be constructed using path expressions, which describe traversals through the graph.

Instead of providing optimal performance for a limited range of path expressions, we propose a mechanism which is shown to have consistent and high performance for path expressions of any complexity, including those with descendant operators (path wildcards). We further detail mechanisms which employ our index to perform more complex processing, such as evaluating both path expressions containing links and entire (sub) queries containing path based predicates. Performance is shown to be independent of the number of terms in the path expression(s), even where these expressions contain wildcards. Experiments show that our index is faster than conventional methods by up to two orders of magnitude for certain query types, is compact, and scales well.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul. Querying semi-structured data. In ICDT, 1997.Google Scholar
  2. 2.
    M. Barg and R. K. Wong. Fast and versatile path index for querying semi-structured data. Full paper. Technical Report 0209, University of NSW, 2002. Available at: ftp://ftp.cse.unsw.edu.au/pub/doc/papers/UNSW/0209.ps.Z.
  3. 3.
    M. Barg and R.K. Wong. Structural proximity searching for large collections of semi-structured data. In ACM CIKM, 2001.Google Scholar
  4. 4.
    M. Barg and R.K. Wong. A fast and versatile path index for querying semi-structured data. In 8th Intl. Conf. on Database Systems for Advanced Applications (DASFAA’03), Kyoto, Japan, March 2003.Google Scholar
  5. 5.
    N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: Optimal xml pattern matching. In SIGMOD, 2002.Google Scholar
  6. 6.
    S. Chien, V. Tsotras, C. Zaniolo, and D. Zhang. Efficient complex query support for multiversion XML documents. In EDBT, 2002.Google Scholar
  7. 7.
    B. Cooper, N. Sample, M. Franklin, G. Hjaltason, and M. Shadmon. A fast index for semi-structured data. In VLDB, 2001.Google Scholar
  8. 8.
    R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, 1997.Google Scholar
  9. 9.
    T. Grust. Accelerating xpath location steps. In SIGMOD, 2002.Google Scholar
  10. 10.
    R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In SIGMOD, 2002.Google Scholar
  11. 11.
    Q. Li and B. Moon. Indexing and querying xml data for regular path expressions. In VLDB, 2001.Google Scholar
  12. 12.
    J. McHugh, S. Abiteboul, R. Goldman, D. Quass, and J. Widom. Lore: A database management system for semistructured data. In SIGMOD, 1997.Google Scholar
  13. 13.
    University of New South Wales. The Soda2 project. http://www.cse.unsw.edu.au/soda/.
  14. 14.
    J. Shanmugasundaram, K. Tufte, C. Zhang, G. He, D. DeWitt, and J. Naughton. Relational databases for querying XML documents: Limitations and opportunities. In VLDB, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Michael Barg
    • 1
  • Raymond K. Wong
    • 1
  • Franky Lam
    • 1
  1. 1.School of Computer Science and EngineeringUniversity of New South WalesSydneyAustralia

Personalised recommendations