Index and storage design in native XML databases

ABSTRACT

Using a native XML DBMS to efficiently store and retrieve XML data has been well studied in recent years. Various native XML DBMSs were developed, and they support most of the features of XQuery. The core topics of these studies are indexing methods for XML. Most existing native XML DBMSs use range based indexing methods, resulting in significant extra space and system degradation.In this paper, we present a method that maps XML data into relational tables. Our method is still range based, which means it can process queries with regular path expression efficiently. But with the introduction of node grouping, the extra space needed for the indexing is reduced significantly. With fewer tables created, we will show that query processing can also be significantly expedited.

REFERENCES

• 1: Edith Cohen , Haim Kaplan , Tova Milo, Labeling dynamic XML trees, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 03-05, 2002, Madison, Wisconsin [doi>10.1145/543613.543648]
• 2: Jayavel Shanmugasundaram , Kristin Tufte , Chun Zhang , Gang He , David J. DeWitt , Jeffrey F. Naughton, Relational Databases for Querying XML Documents: Limitations and Opportunities, Proceedings of the 25th International Conference on Very Large Data Bases, p.302-314, September 07-10, 1999
• 3: H. V. Jagadish , S. Al-Khalifa , A. Chapman , L. V. S. Lakshmanan , A. Nierman , S. Paparizos , J. M. Patel , D. Srivastava , N. Wiwatwattana , Y. Wu , C. Yu, TIMBER: A native XML database, The VLDB Journal — The International Journal on Very Large Data Bases, v.11 n.4, p.274-291, December 2002 [doi>10.1007/s00778-002-0081-x]
• 4: Quanzhong Li , Bongki Moon, Indexing and Querying XML Data for Regular Path Expressions, Proceedings of the 27th International Conference on Very Large Data Bases, p.361-370, September 11-14, 2001