Skip to main content

UD(k,l)-Index: An Efficient Approximate Index for XML Data

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2762))

Abstract

XML has become the main standard of data presentation and exchange on the Internet. Processing path expressions plays a key role in XML queries evaluation. Path indices can speed up path expressions evaluation on XML data by restricting search only to the relevant portion. However, to answer all path expressions accurately, traditional path indices group data nodes according to the paths from the root of the data graph to the nodes in question, regardless of the paths fanning out from these nodes. This leads to large indices size and low efficiency of branching path expressions evaluation. In this paper, we present UD(k,l)-indices, a family of efficient approximate index structures in which data nodes are grouped according to their incoming paths of length up to k and outgoing paths of length up to l. UD(k,l)-indices fully exploit local similarity of XML data nodes on their upward and downward paths, so can be used for efficiently evaluating path expressions, especially branching path expressions. For small values of k and l, UD(k,l)-index is approximate, we use validation-based approach to find exact answers to the path expressions. Experiments show that with proper values of k and l, UD(k,l)-index can improve the performance of path expressions evaluation significantly with low space overhead.

This work is supported by the National Natural Science Foundation of China under Grant No. 60228006.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S.: Quering semi-structured data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 1–18. Springer, Heidelberg (1997)

    Google Scholar 

  2. Buneman, P., Kaushik, R., Suciu, D.: A query language and algebra for semistructured data based on structural recursion. In: Proc. of Int’l Conf. on Very Large Databases (VLDB), vol. 9(1), pp. 76–110 (2000)

    Google Scholar 

  3. Chamberlin, D., et al.: XQuery 1.0: An XML Query Language. W3C Working Draft (June 2001), http://www.w3.org/TR/xquery

  4. Clark, J., DeRose, S.: XML Path Language (XPath). W3C Working Draft (November 1999), http://www.w3.org/TR/xpath

  5. Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A fast index for semistructured data. In: Proc. of Int’l Conf. on Very Large Databases (VLDB), pp. 341–350 (2001)

    Google Scholar 

  6. DeRose, S., Maler, E., Orchard, D.: The xlink standard (June 2001), http://www.w3.org/TR/xlink

  7. Deutsch, A., Fernandez, M., Florescu, D., Levy, A., Suciu, D.: A query language for XML. In: Proc. of Int’l World Wide Web Conf, WWW (1999)

    Google Scholar 

  8. Gionis, A., Garofalakis, M., Rastogi, R., Seshadri, S., Shim, K.: XTRACT: A system for extracting for document type descriptors from XML documents. In: Proc. of ACM SIGMOD Conf. on Management of Data, pp. 165–176 (2000)

    Google Scholar 

  9. Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: Proc. of Int’l Conf. on Very Large Databases (VLDB), pp. 436–445 (1997)

    Google Scholar 

  10. Goldman, R., Widom, J.: Approximate dataguides. In: The WorkShop on Query Processing for Semistructured Data and Non-Standared Data Formats, Jerusalem, Israel (1999)

    Google Scholar 

  11. Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for efficient indexing of paths in graph structured data. In: Proc. of IEEE Int’l Conf. on Data Engineering, ICDE (2002)

    Google Scholar 

  12. McHugh, J., Abiteboul, S., Goldman, R., Quass, D., Widom, J.: Lore: A database management system for semistructured data. SIGMOD Record 26(3) (1997)

    Google Scholar 

  13. Milo, D., Suciu, D.: Index structure for path expression. In: Proc. of Int’l Conf. on Database Theory (ICDT), pp. 277–295 (1999)

    Google Scholar 

  14. Nestorov, S., Abiteboul, S., Motwani, R.: Extracting schema from semistructured data. SIGMOD Record 27(2), 295–305 (1998)

    Article  Google Scholar 

  15. Nestorov, S., Ullman, J., Weiner, J., Chawathe, S.: Representative objects: Concise representations of semistructured, hierarchical data. In: Proc. of IEEE Int’l Conf. on Data Engineering (ICDE), pp. 79–90 (1999)

    Google Scholar 

  16. XMark. The XML benchmark project, http://monetb.cwi.nl/xml/index.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, H., Wang, Q., Yu, J.X., Zhou, A., Zhou, S. (2003). UD(k,l)-Index: An Efficient Approximate Index for XML Data. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45160-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40715-7

  • Online ISBN: 978-3-540-45160-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics