Storing and querying ordered XML using a relational database system
Authors:
Top Cited Papers
Open Access
- 3 June 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 204-215
Abstract
XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to store and query XML documents. Researchers have proposed using relational database systems to satisfy these requirements by devising ways to "shred" XML documents into relations, and translate XML queries into SQL queries over these relations. However, a key issue with such an approach, which has largely been ignored in the research literature, is how (and whether) the ordered XML data model can be efficiently supported by the unordered relational data model. This paper shows that XML's ordered data model can indeed be efficiently supported by a relational database system. This is accomplished by encoding order as a data value. We propose three order encoding methods that can be used to represent XML order in the relational data model, and also propose algorithms for translating ordered XPath expressions into SQL using these encoding methods. Finally, we report the results of an experimental study that investigates the performance of the proposed order encoding methods on a workload of ordered XML queries and updates.Keywords
This publication has 9 references indexed in Scilit:
- From XML schema to relations: a cost-based approach to XML storage2003
- A general technique for querying XML documents using a relational database systemACM SIGMOD Record, 2001
- XRelACM Transactions on Internet Technology, 2001
- Updating XML2001
- Efficient evaluation of XML middle-ware queries2001
- On supporting containment queries in relational database management systems2001
- Storing semistructured data with STORED1999
- Sequence query processing1994
- A taxonomy of time databases1985