A graph based cluster approach for vertical partitioning in database design
Data & Knowledge Engineering
A comprehensive approach to horizontal class fragmentation in a distributed object based system
Distributed and Parallel Databases
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Algorithms and Support for Horizontal Class Partitioning in Object-Oriented Databases
Distributed and Parallel Databases
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Statistical synopses for graph-structured XML databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Using histograms to estimate answer sizes for XML queries
Information Systems - Special issue: Best papers from EDBT 2002
Counting Twig Matches in a Tree
Proceedings of the 17th International Conference on Data Engineering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The VLDB Journal — The International Journal on Very Large Data Bases
From XML Schema to Relations: A Cost-Based Approach to XML Storage
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Statistical learning techniques for costing XML queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Storing and retrieving XPath fragments in structured P2P networks
Data & Knowledge Engineering - Special issue: WIDM 2004
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The BEA/XQRL streaming XQuery processor
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Hi-index | 0.00 |
Fragmentation techniques for XML data are gaining momentum within both distributed and centralized XML query engines and pose novel and unrecognized challenges to the community. Albeit not novel, and clearly inspired by the classical divide et impera principle, fragmentation for XML trees has been proved successful in boosting the querying performance, and in cutting down the memory requirements. However, fragmentation considered so far has been driven by semantics, i.e. built around query predicates. In this paper, we propose a novel fragmentation technique that founds on structural constraints of XML documents (size, tree-width, and tree-depth) and on special-purpose structure histograms able to meaningfully summarize XML documents. This allows us to predict bounding intervals of structural properties of output (XML) fragments for efficient query processing of distributed XML data. An experimental evaluation of our study confirms the effectiveness of our fragmentation methodology on some representative XML data sets.