Skip to main content

A Relational Nested Interval Encoding Scheme for XML Storage and Retrieval

  • Conference paper
Information Retrieval Technology (AIRS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3689))

Included in the following conference series:

Abstract

The XML data is a typical kind of tree-data. However, the XML research community has given little attention to the traditional Relational database Management System(RDBMS) based encoding schemes for tree-data. In this paper, we will investigate one of the traditional RDBMS-based encoding schemes, called Nested Interval, for storage and retrieval of XML data. Especially, our approach is very robust for updating XML data, including insertion of new nodes. In fact, the existing RDBMS-based XML storage and indexing techniques work very poorly against XML data updates because they should be rebuilt from the scratch when any update occurs in XML data. In contract, our scheme does not require re-encoding. In this respect, our approach is a viable option for storing and querying update-intensive XML applications.

This work was supported by grant No.(R05-2003-000-11943-0) from Korea Science & Engineering Foundation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Floresce, D., kossman, D.: Storing and Querying XML data Using a RDBMS. IEEE Data Engineering Bulletin 22(3) (1999)

    Google Scholar 

  2. Tatarinov, I., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: Proc. ACM SIGMOD Int’l Conf. on Management of Data (2002)

    Google Scholar 

  3. Grust, T.: Accelerating XPath Location Steps. In: ACM SIGMOD, Madison (June 2003)

    Google Scholar 

  4. W3C, XML Path Language(XPath), Version 1.0, W3C Recommendation (November 1999)

    Google Scholar 

  5. Celko, J.: Joe Celko’s Trees & Hierarchies in SQL for Smarties. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  6. Tropashko, V.: Trees in SQL:Nested Sets and Materialized Path (2003a), http://www.dbazine.com/tropashko4.shtml

  7. Tropashko, V.: Nested Intervals with Farey Fractions. eprint arXiv:cs/0401014 (2004)

    Google Scholar 

  8. http://www.saxproject.org/

  9. The Plays of Shakespeare in XML, http://www.xml.com/pub/r/396

  10. Na, G.-J., Lee, S.-W.: A Relational Nested Interval Encoding Scheme for XML Storage and Retrieval (Technical Report Version), http://vldb.skku.ac.kr/pdf/ninterval.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Na, GJ., Lee, SW. (2005). A Relational Nested Interval Encoding Scheme for XML Storage and Retrieval. In: Lee, G.G., Yamada, A., Meng, H., Myaeng, S.H. (eds) Information Retrieval Technology. AIRS 2005. Lecture Notes in Computer Science, vol 3689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562382_73

Download citation

  • DOI: https://doi.org/10.1007/11562382_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29186-2

  • Online ISBN: 978-3-540-32001-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics