Storing and querying XML data in object-relational DBMSs

17Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As the popularity of eXtensible Markup Language (XML) continues to increase at an astonishing pace, data management systems for storing and querying large repositories of XML data are urgently needed. In this paper, we investigate an Object-Relational DBMS (ORDBMS) for storing and querying XML data. We present an algorithm, called XORator, for mapping XML documents to tables in an ORDBMS. An important part of this mapping is assigning a fragment of an XML document to a new XML data type. We demonstrate that using the XORator algorithm, an ORDBMS is usually more efficient than a Relational DBMS (RDBMS). Based on an actual implementation in DB2 V.7.2, we compare the performance of the XORator algorithm with a well-known algorithm for mapping XML data to an RDBMS. Our experiments show that the XORator algorithm requires less storage space, has much faster loading times, and in most cases can evaluate queries faster. The primary reason for this performance improvement is that the XORator algorithm results in a database that is smaller in size, and queries that usually have fewer number of joins. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Runapongsa, K., & Patel, J. M. (2002). Storing and querying XML data in object-relational DBMSs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2490 LNCS, pp. 266–285). Springer Verlag. https://doi.org/10.1007/3-540-36128-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free