XML subtree reconstruction from relational storage of XML documents

Numerous researchers have proposed to use relational databases to store and query XML documents. In these systems, the elements selected by an XML query are returned to an application either by select mode or by reconstruct mode. For the reconstruct mode, the XML subtrees that are rooted at the selected elements need to be extracted and reconstructed from the relational storage of XML documents. Therefore, XML subtree reconstruction is an important problem since its efficiency has a significant impact on XML query response time. In this paper, we propose (i) a linear XML subtree reconstruction algorithm Reconstruct to reconstruct an XML subtree from the structure-encoded sequence of the subtree that is extracted from the relational database by a structure-encoded sequence retrieval algorithm, (ii) a generic efficient structure-encoded sequence retrieval algorithm RD-SB for a schema-based relational XML storage, and (iii) a generic efficient structure-encoded sequence retrieval algorithm RD-SL for a schema-less relational XML storage. To the best of our knowledge, our algorithms provide the first generic solutions to the XML subtree reconstruction problem that are applicable to all relational XML storage schemes proposed in the literature. Finally, our experiments show that our algorithms are efficient and scalable.

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

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

[3]  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.

[4]  Hongjun Lu,et al.  PBiTree coding and efficient processing of containment joins , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

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

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

[7]  Wolfgang Meier,et al.  eXist: An Open Source Native XML Database , 2002, Web, Web-Services, and Database Systems.

[8]  Shiyong Lu,et al.  Efficient schema-based XML-to-Relational data mapping , 2007, Inf. Syst..

[9]  Carlo Zaniolo,et al.  Efficient Structural Joins on Indexed XML Documents , 2002, VLDB.

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

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

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

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

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

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

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

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

[18]  David J. DeWitt,et al.  On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

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

[20]  Torsten Grust,et al.  Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps , 2003, VLDB.

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

[22]  Kunal Verma,et al.  Designing a high-performance database engine for the 'Db4XML' native XML database system , 2004, J. Syst. Softw..

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

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

[25]  Shiyong Lu,et al.  Reconstructing XML Subtrees from Relational Storage of XML documents , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

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

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

[28]  M. Tamer Özsu,et al.  A comprehensive XQuery to SQL translation using dynamic interval encoding , 2003, SIGMOD '03.

[29]  Jignesh M. Patel,et al.  Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

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

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

[32]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

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

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

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

[36]  Quanzhong Li,et al.  Indexing and Querying XML Data for Regular Path Expressions , 2001, VLDB.

[37]  Hongjun Lu,et al.  Holistic Twig Joins on Indexed XML Documents , 2003, VLDB.