Efficient schema-based XML-to-Relational data mapping
Information Systems
XML subtree reconstruction from relational storage of XML documents
Data & Knowledge Engineering
Xpath on steroids: exploiting relational engines for xpath performance
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A content-aware adaptive storage approach for XML in PXRDB
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
Numerous researchers have proposed to use relational databases to store and query XML documents. One important component of such systems is the XML subtree reconstruction, which reconstructs the subtrees rooted at the matching nodes of an XML query and returns them to the user as the query result. Existing reconstruction algorithms either do not support recursive XML view schema, or require expensive nested queries or joins of multiple relations. In this paper, we propose an efficient XML subtree reconstruction algorithm, Reconstruct, which overcomes these limitations and uses an efficient stack-based structural join algorithm to recover all the parent-child relationships between elements. One salient advantage of this algorithm is that it employs the inlining feature of the inlining-based storage of XML documents, which is known as one of the best relational XML storage schemes. Both our algorithmic analysis and experimental study show that Reconstruct is efficient and scalable.