XML is quickly becoming the <i>de facto</i> 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 <i>ordered</i> 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 <i>order encoding methods</i> 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.
Description
Storing and querying ordered XML using a relational database system
%0 Conference Paper
%1 Tatarinov:2002:SQO:564691.564715
%A Tatarinov, Igor
%A Viglas, Stratis D.
%A Beyer, Kevin
%A Shanmugasundaram, Jayavel
%A Shekita, Eugene
%A Zhang, Chun
%B Proceedings of the 2002 ACM SIGMOD international conference on Management of data
%C New York, NY, USA
%D 2002
%I ACM
%K relational xml dbms semistructured_data
%P 204--215
%R 10.1145/564691.564715
%T Storing and querying ordered XML using a relational database system
%U http://doi.acm.org/10.1145/564691.564715
%X XML is quickly becoming the <i>de facto</i> 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 <i>ordered</i> 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 <i>order encoding methods</i> 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.
%@ 1-58113-497-5
@inproceedings{Tatarinov:2002:SQO:564691.564715,
abstract = {XML is quickly becoming the <i>de facto</i> 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 <i>ordered</i> 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 <i>order encoding methods</i> 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.},
acmid = {564715},
added-at = {2011-04-14T16:31:15.000+0200},
address = {New York, NY, USA},
author = {Tatarinov, Igor and Viglas, Stratis D. and Beyer, Kevin and Shanmugasundaram, Jayavel and Shekita, Eugene and Zhang, Chun},
biburl = {https://www.bibsonomy.org/bibtex/23dead41e78f0a596620640a33f142b07/schmidt2},
booktitle = {Proceedings of the 2002 ACM SIGMOD international conference on Management of data},
description = {Storing and querying ordered XML using a relational database system},
doi = {10.1145/564691.564715},
interhash = {ca0277efc9845c54703d5d7a39237562},
intrahash = {3dead41e78f0a596620640a33f142b07},
isbn = {1-58113-497-5},
keywords = {relational xml dbms semistructured_data},
location = {Madison, Wisconsin},
numpages = {12},
pages = {204--215},
publisher = {ACM},
series = {SIGMOD '02},
timestamp = {2011-09-22T10:01:48.000+0200},
title = {Storing and querying ordered XML using a relational database system},
url = {http://doi.acm.org/10.1145/564691.564715},
year = 2002
}