College of Information Technology and Science, Nankai University, Tianjin, China

---

Abstract—XML is de facto new standard for data representation and exchanging on the web. Along with the growth of XML data, traditional relational databases support XML data processing across-the-board. Consistent storage and efficient query for XML data is the chief problem in XML supported relational databases. This work presents mechanisms of Storage and query optimization for XML data in relational database. XML data are treated as a kind of data type in relational database, and XML tables are used to store native XML data in fixed schema. Structural summary index is built and maintained in relational database and an optimizing mechanism based on XPath model named Compressed XML Query Tree will also be presented in order to improve efficiency of XML data query by reducing superabundant join operations from ancestordescendent axis. All strategies are appropriate for classical XML query algorithms. Algorithms for XML query will be performed in experiments on real XML datasets in relational database and query workloads to report the performance of our mechanism and show the efficiency compared with other mechanisms.

Index Terms—XML, XPath, Data Storage, Query Optimization, Compressed XPath Query Tree.

[PDF]

Cite: Xiaojie Yuan, Xiangyu Hu, Dongxing Wu, Haiwei Zhang, Xin Lian, "XML Data Storage and Query Optimization in Relational Database by XPath Processing Model," Journal of Software vol. 8, no. 4, pp. 809-816, 2013.