Reconstructing XML Subtrees from Relational Storage of XML documents

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.

[1]  Shiyong Lu,et al.  A New Inlining Algorithm for Mapping XML DTDs to Relational Schemas , 2003, ER.

[2]  David J. DeWitt,et al.  The design and performance evaluation of alternative XML storage strategies , 2002, SGMD.

[3]  David J. DeWitt,et al.  Relational Databases for Querying XML Documents: Limitations and Opportunities , 1999, VLDB.

[4]  Alin Deutsch,et al.  Storing semistructured data with STORED , 1999, SIGMOD '99.

[5]  Dan Suciu,et al.  SilkRoute: A framework for publishing relational data in XML , 2002, TODS.

[6]  Ahmad Ashari,et al.  Storing And Querying XML Data Using RDBMS , 2004, iiWAS.

[7]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[8]  Vishu Krishnamurthy,et al.  Performance Challenges in Object-Relational DBMSs , 1999, IEEE Data Eng. Bull..

[9]  Jeffrey F. Naughton,et al.  A general technique for querying XML documents using a relational database system , 2001, SGMD.

[10]  Hamid Pirahesh,et al.  Efficiently publishing relational data as XML documents , 2001, The VLDB Journal.

[11]  Dan Suciu,et al.  SilkRoute: trading between relations and XML , 2000, Comput. Networks.

[12]  Dongwon Lee,et al.  XML to Relational Conversion Using Theory of Regular Tree Grammars , 2003, EEXTT.

[13]  Dan Suciu,et al.  Efficient evaluation of XML middle-ware queries , 2001, SIGMOD '01.

[14]  Dongwon Lee,et al.  Constraints-Preserving Transformation from XML Document Type Definition to Relational Schema , 2000, ER.

[15]  Dan Suciu,et al.  Translating XSLT programs to Efficient SQL queries , 2002, WWW '02.

[16]  Sumit Ganguly,et al.  Optimizing View Queries in ROLEX to Support Navigable Result Trees , 2002, VLDB.

[17]  M. Tamer Özsu,et al.  XBench - A Family of Benchmarks for XML DBMSs , 2002, EEXTT.

[18]  Jeffrey F. Naughton,et al.  Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation , 2004, Proceedings. 20th International Conference on Data Engineering.

[19]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[20]  Forouzan Golshani,et al.  Proceedings of the Eighth International Conference on Data Engineering , 1992 .

[21]  Juliana Freire,et al.  From XML schema to relations: a cost-based approach to XML storage , 2002, Proceedings 18th International Conference on Data Engineering.

[22]  Eugene J. Shekita,et al.  Querying XML Views of Relational Data , 2001, VLDB.

[23]  Ioana Manolescu,et al.  Answering XML Queries on Heterogeneous Data Sources , 2001, VLDB.

[24]  Torsten. Grust,et al.  Accelerating XPath location steps , 2002, SIGMOD '02.

[25]  Menzo Windhouwer,et al.  Efficient Relational Storage and Retrieval of XML Documents , 2000, WebDB.