Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
IBM Journal of Research and Development - Special issue: optical lithography I
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Toward an Ideal Data Placement Scheme for High Performance Object-Oriented Database Systems
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Database Partitioning in a Cluster of Processors
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.02 |
As XML is increasingly being used in Web applications, new technologies need to be investigated for processing XML documents with high performance. Parallelism is a promising solution for structured document processing and data placement is a major factor for system performance improvement in parallel processing. This paper describes an effective XML document data placement strategy. The new strategy is based on a multilevel graph partitioning algorithm with the consideration of the unique features of XML documents and query distributions. A new algorithm, which is based on XML query schemas to derive the weighted graph from the labelled directed graph presentation of XML documents, is also proposed. Performance analysis on the algorithm presented in the paper shows that the new data placement strategy exhibits low workload skew and a high degree of parallelism.