Skip to main content

Indexing XML Data for Path Expression Queries

  • Conference paper
Software Engineering Research and Applications (SERA 2003)

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

  • 870 Accesses

Abstract

Many XML query languages use regular path expressions to query XML data. Retrieval of XML data is like retrieval of relational databases, but the difference is that relational data are stored in 2-D flat tables whereas XML data are organized in a tree-like structure. Hence, fast tree traversal is a key to XML query processing. This is commonly accomplished using indexing. In this paper, we present a design and implementation of an efficient and quick solution to indexing XML data. Our approach is based on a numbering scheme that encodes the XML elements for not only indexing to the elements but also for quick determination of the ancestor-descendant relationship between elements in the tree hierarchy. This approach also allows efficiently inserting and updating the index system, which is an improvement over several existing XML tree node numbering methods.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berkeley, D.B.: http://www.sleepycat.com/docs/ref/refs/bdb-usenix.html

  2. Chamberlin, D., Florescu, D., Robie, J., Simon, J., Stefanescu, M.: XQuery: A Query Language for XML. W3C working Draft, Technical Report WD-xquery-20010215, World Wide Web Consortium (2001)

    Google Scholar 

  3. Clark, J., DeRose, S.: XML Path Language (XPath) Version 1.0. W3C Recommendation. Technical Report REC-xpath-19991116, World Wide Web Consortium (1999)

    Google Scholar 

  4. Cooper, B.F., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A Fast Index for Semistructured Data. In: Proceedings of the 27th International Conference on Very Large Databases, Rome, Italy (2001)

    Google Scholar 

  5. Dietz, P.F.: Maintaining order in a Linked List. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, California (1982)

    Google Scholar 

  6. Egnor, D., Lord, R.: Structured Information Retrieval Using XML, http://www.haifa.il.ibm.com/sigir00-xml/final-papers/Egnor

  7. Emily, http://www.emilysolutions.com

  8. Etymon, http://www.etymon.com/amberfish/index.html

  9. Katz, H.: XQEngine, http://www.fatdog.com

  10. Kha, D., Yoshikawa, M., Uemura, S.: An XML Indexing Structure with Relative Region Coordinates. In: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany (2001)

    Google Scholar 

  11. Larson, R.R.: Cheshire II Project, http://cheshire.lib.berkeley.edu

  12. Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proceedings of the 27th International Conference on Very Large Databases, Rome, Italy (2001)

    Google Scholar 

  13. Luk, R., Chan, A., Dillon, T.S., Leong, H.V.: A survey of search engines for XML documents. In: SIGIR 2000 Workshop on XML and Information Retrieval, Athens, Greece, pp. 1–9 (2000)

    Google Scholar 

  14. McHugh, J., Widom, J., Abiteboul, S., Luo, Q., Rajaraman, A.: Indexing Semistructured Data. Technical Report, Stanford University (1998)

    Google Scholar 

  15. Rizzolo, F., Mendelzon, A.: Indexing XML Data with ToXin. In: Fourth International Workshop on the Web and Databases (in conjunction with ACM SIGMOD 2001), Santa Barbara, California (2001)

    Google Scholar 

  16. Shanmugasundaram, J., et al.: Relational Databases for Querying XML Documents: Limitations and Opportunities. In: Proc. Of the 25th International Conference on VLDB, Edinburgh, Scotland (1999)

    Google Scholar 

  17. Structured Information Manager, http://www.simdb.com

  18. Tian, F., DeWitt, D.J., Chen, J.: The Design and Performan ce Evaluation of Alternative XML Storage Strategies: SIGMOD Record special issue on Data Management Issues in E-Commerce (2002)

    Google Scholar 

  19. Turau, V.: Making Legacy Data Accessible for XML Applications, http://www.informatik.fh-wiesbaden.de/turau/veroeff.html

  20. Yoon, J., Raghavan, V., Chakilam, V., Kerschberg, L.: BitCube: A Three-Dimensional Bitmap Indexing for XML Documents. Journal of Intelligent Information Systems 17 (2001)

    Google Scholar 

  21. Yoshikawa, M., Amasaga, T., Shimura, T., Uemura, S.: XRel: A Path-Based Approach to Storage and Retrieval of XML Documents using Relational Databases. ACM Trans. On Internet Technology (2001)

    Google Scholar 

  22. XDisect - XML Refined Search, http://www.pybiz.com/products/xdisect

  23. Xset Enabling XML Applications, http://www.cs.berkeley.edu

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, G., Tang, C. (2004). Indexing XML Data for Path Expression Queries. In: Ramamoorthy, C.V., Lee, R., Lee, K.W. (eds) Software Engineering Research and Applications. SERA 2003. Lecture Notes in Computer Science, vol 3026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24675-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24675-6_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21975-0

  • Online ISBN: 978-3-540-24675-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics