A relational nested interval encoding scheme for XML storage and retrieval

Authors:
Gap-Joo Na;Sang-Won Lee
Affiliations:
Dept. of Computer Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea;Dept. of Computer Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea
Venue:
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Year:
2005

Citing 3
Cited 1

Accelerating XPath location steps

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Joe Celko's SQL for Smarties: Trees and Hierarchies

Joe Celko's SQL for Smarties: Trees and Hierarchies

Efficient lineage tracking for scientific workflows

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

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.