TY - GEN
T1 - Efficiently querying XML documents stored in RDBMS in the presence of Dewey-based labeling scheme
AU - Maghaydah, Moad
AU - Orgun, Mehmet A.
PY - 2010
Y1 - 2010
N2 - Storing an XML document as a single record of type BLOB (or sequence of bytes) in RDBMS has become a widely used solution that reduces the complexity of reassembling the original document. However, shredding and indexing the XML document, using special labeling methods to recover the document order, is still required to efficiently support data-centric queries. The Dewey based labeling method has been considered to be the most suitable labeling technique to support dynamic XML documents. In this paper, we present a new space-efficient and easy to process Dewey-based labeling scheme. The new label structure, which is composed of two components: (Parent, Child) in Dewey format, would significantly improve the performance of XML queries that are based on parent-child and sibling relationships. Furthermore, we introduce an efficient alternative approach to navigate upwards the XML tree, which can be used to validate ancestor relationships. We report on an extensive experimental label length evaluation and performance tests between our approach and some recent Dewey based approaches using well-known XML benchmarks.
AB - Storing an XML document as a single record of type BLOB (or sequence of bytes) in RDBMS has become a widely used solution that reduces the complexity of reassembling the original document. However, shredding and indexing the XML document, using special labeling methods to recover the document order, is still required to efficiently support data-centric queries. The Dewey based labeling method has been considered to be the most suitable labeling technique to support dynamic XML documents. In this paper, we present a new space-efficient and easy to process Dewey-based labeling scheme. The new label structure, which is composed of two components: (Parent, Child) in Dewey format, would significantly improve the performance of XML queries that are based on parent-child and sibling relationships. Furthermore, we introduce an efficient alternative approach to navigate upwards the XML tree, which can be used to validate ancestor relationships. We report on an extensive experimental label length evaluation and performance tests between our approach and some recent Dewey based approaches using well-known XML benchmarks.
KW - labeling dynamic XML documents
KW - XML management systems
KW - XML query processing in RDBMS
UR - http://www.scopus.com/inward/record.url?scp=77956986908&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-12145-6_5
DO - 10.1007/978-3-642-12145-6_5
M3 - Conference proceeding contribution
AN - SCOPUS:77956986908
SN - 3642121446
SN - 9783642121449
VL - 5990 LNAI
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 43
EP - 53
BT - Intelligent Information and Database Systems - Second International Conference, ACIIDS, Proceedings
A2 - Nguyen, Ngoc Thanh
A2 - Le, Manh Thanh
A2 - Swiatek, Jerzy
PB - Springer, Springer Nature
CY - Berlin; Heidelberg
T2 - 2010 Asian Conference on Intelligent Information and Database Systems, ACIIDS 2010
Y2 - 24 March 2010 through 26 March 2010
ER -