Title: Efficiently querying dynamic XML documents stored in relational database systems

Authors: Moad Maghaydah, Mehmet A. Orgun

Addresses: Department of Computing, Macquarie University, E6A, Level 3, Sydney, NSW 2109, Australia. ' Department of Computing, Macquarie University, E6A, Level 3, Sydney, NSW 2109, Australia

Abstract: Storing XML documents in relational database systems has become a widely used solution. However, in the process of shredding and indexing the XML document, the use of special labelling methods to recover the document order is still required in order to efficiently support data-centric queries and update operations (e.g., the addition and deletion of nodes from the document). In this paper, we present a new space-efficient labelling scheme based on Dewey codes. The new label structure, which is composed of parent-child components in the Dewey format, would significantly improve the performance of XML queries that are based on parent-child and sibling relationships. Furthermore, we introduce an alternative approach to validate ancestor relationships and to navigate upwards in XML trees efficiently. We report on an extensive experimental evaluation using several well-known XML benchmarks for the comparison of the impact of our approach on label length and query performance against those of some other recent Dewey-based approaches.

Keywords: XML management systems; XML document labelling; dynamic XML documents; XML query optimisation; relational-based XML storage systems; relational database management systems; RDBMS; Dewey codes.

DOI: 10.1504/IJIIDS.2011.041324

International Journal of Intelligent Information and Database Systems, 2011 Vol.5 No.4, pp.389 - 408

Received: 05 Jul 2010
Accepted: 30 Oct 2010
Published online: 21 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article