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
Developing an Indexing Scheme for XML Document Collection using the Oracle8i Extensibility Framework
Proceedings of the 27th International Conference on Very Large Data Bases
Joe Celko's SQL for Smarties: Trees and Hierarchies
Joe Celko's SQL for Smarties: Trees and Hierarchies
Nested intervals tree encoding in SQL
ACM SIGMOD Record
| Hi-index | 0.00 |
As XML is rapidly becoming the de-facto standard for data representation and exchange in the Internet age, there has been a lot of research on how to store and retrieve XML data in relational databases. However, even though the XML data is mostly tree-structured, the XML research community has shown little attention to the traditional RDBMS-based encoding scheme for tree data. In this paper, we investigate one of the encoding schemes, called Nested Interval, for the storage and retrieval of XML data. In particular, our approach is very robust in updating XML data, including insertion of new node. In fact, the existing RDBMS-based XML storage and indexing techniques work very poorly against XML data update because the XML data should be re-encoded from the scratch for virtually any update in XML data. In contract, Nested Interval scheme does not require re-encoding all nodes. In this respect, our approach is a viable option for storing and querying update-intensive XML application.