Skip to main content

An XPath Reduction Algorithm for Fast Querying of Digital Libraries in XML

  • Conference paper
Digital Libraries: Technology and Management of Indigenous Knowledge for Global Access (ICADL 2003)

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

Included in the following conference series:

  • 843 Accesses

Abstract

Digital contents in XML are rapidly increasing on the Web. In our work, we assume that the XML data is stored in a relational database using the popular node numbering scheme and propose a technique to pre-process XPath queries in order to convert them into a much more efficient form that will run several times faster. Our algorithm uses a special data structure called XIP (XML Instance Path) tree of each XML document to reduce a given XPath query (i.e., path expression) into a more simpler form. The benefits of the approach is more significant for long length queries, making it useful for digital libraries storing large and complex structured XML documents for multimedia or business applications.

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. Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, v.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: Proc. of the 27th VLDB conference, Hong Kong, China, August 2002, pp. 263–274 (2002)

    Google Scholar 

  2. Clark, J., DeRose, S.: XML Path Language (XPath) Version 1.0, W3C Recommendation. WWW Consortium (November 1999)

    Google Scholar 

  3. Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proc. of the 26th VLDB conference, Rome, Italy (September 2001)

    Google Scholar 

  4. Srivastava, D., Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Wu, Y.: Structural joins: A primitive for efficient XML query pattern matching. In: Proc. of the 2002 IEEE conference on Data Engineering, San Jose, USA (February 2002)

    Google Scholar 

  5. Zhang, C., Naughton, J.F., Luo, Q., DeWitt, D.J., Lohman, G.M.: On supporting containment queries in relational database management systems. In: Proc. of the 2001 ACM-SIGMOD conference, Santa Barbara, CA, USA (May 2001)

    Google Scholar 

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

Shin, H., Lee, M. (2003). An XPath Reduction Algorithm for Fast Querying of Digital Libraries in XML. In: Sembok, T.M.T., Zaman, H.B., Chen, H., Urs, S.R., Myaeng, SH. (eds) Digital Libraries: Technology and Management of Indigenous Knowledge for Global Access. ICADL 2003. Lecture Notes in Computer Science, vol 2911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24594-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24594-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20608-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics