Download:
by Surajit Chaudhuri, Zhiyuan Chen, Kyuseok Shim, Yuqing Wu
IEEE Transactions on Knowledge and Data Engineering
http://www.cs.indiana.edu/~yuqwu/papers/TKDE05.pdf
Add To MetaCart
Abstract:
Abstract — Much of business XML data has accompanying XSD specifications. In many scenarios, “shredding ” such XML data into a relational storage is a popular paradigm. Optimizing evaluation of XPath queries over such XML data requires paying careful attention to both logical and physical design of the relational database where XML data is shredded. None of the existing solutions has taken into account physical design of the generated relational database. In this paper, we study the interplay of logical and physical design and conclude that (1) solving them independently leads to suboptimal performance; (2) there is substantial overlap between logical and physical design: some well-known logical design transformations generate the same mappings as physical design. Furthermore, existing search algorithms are inefficient to search the extremely large space of logical and physical design combinations. We propose a search algorithm that carefully avoids searching duplicated mappings and utilizes the workload information to further prune the search space. Experimental results confirm the effectiveness of our approach. Index Terms — XML, Physical Design, Relational Databases. I.
Citations
|
323
|
Relational databases for querying XML documents: Limitations and opportunities
– Shanmugasundaram, He, et al.
- 1999
|
|
249
|
From Structural Documents to Novel Query Facilities
– Christophides, Abiteboul, et al.
- 1994
|
|
187
|
Storing and Querying XML Data using an RDBMS
– Florescu, Kossman
- 1999
|
|
140
|
Holistic twig joins: Optimal XML pattern matching
– Bruno, Koudas, et al.
- 2002
|
|
113
|
Efficiently Publishing Relational Data as XML Documents
– Shanmugasundaram, Shekita, et al.
- 2000
|
|
101
|
From XML Schema To Relations: A Cost-Based Approach to XML
– Bohannon, Freire, et al.
- 2002
|
|
87
|
TIMBER: A native XML database
– Jagadish
|
|
80
|
Efficient Relational Storage and Retrieval of XML Documents
– Schmidt, Kersten, et al.
- 2000
|
|
73
|
An E cient, CostDriven Index Selection Tool for Microsoft SQL Server
– Chaudhuri, Narasayya
- 1997
|
|
68
|
Efficient Evaluation of XML Middle-ware Queries
– Fernandez, Morishima, et al.
- 2001
|
|
55
|
DB2 Advisor: An optimizer smart enough to recommend its own indexes
– Lohman, Valentin, et al.
- 2000
|
|
53
|
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
– Wang, Park, et al.
|
|
52
|
Storage and Retrieval of XML Documents using Object-Relational Databases
– Shimura, Yoshikawa, et al.
- 1999
|
|
33
|
XML and Object-Relational Database Systems – Enhancing Structural Mappings Based on Statistics
– Klettke, Meyer
- 1997
|
|
31
|
StatiX: making XML count
– Freire, Haritsa, et al.
|
|
16
|
Integrating vertical and horizontal partitioning into automated physical database design
– Agrawal, Narasayya, et al.
- 2004
|
|
14
|
Efficient XML-to-SQL query translation: Where to add the intelligence
– Krishnamurthy, Kaushik, et al.
- 2004
|
|
12
|
Oracle8i - the XML enabled data management system
– Banerjee, Krishnamurthy, et al.
- 2000
|
|
12
|
Storing semistructured data with
– Deutsch, Fernandez, et al.
- 1999
|
|
11
|
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective
– Krishnamurthy, Chakaravarthy, et al.
- 2003
|
|
11
|
Searching for Efficient XML-toRelational Mappings
– Ramanath, Freire, et al.
- 2003
|
|
11
|
Automated selection of materialized views and indexes
– Agrawal, Chaudhuri, et al.
- 2000
|
|
1
|
Web Consortium, “XML schema
– Wide
- 2001
|
