Affinity­based XML Fragmentation

In this paper we tackle the fragmentation problem for highly distributed databases. In such an environment, a suitable fragmentation strategy may provide scalability and availability by minimizing distributed transactions. We propose an approach for XML fragmentation that takes as input both the application's expected workload and a storage threshold, and produces as output an XML fragmentation schema. Our workload-aware method aims to minimize the execution of distributed transactions by packing up related data in a small set of fragments. We present experiments that compare alternative fragmentation schemas, showing that the one produced by our technique provides a finer-grained result and better system throughput.

[1]  Marta Mattoso,et al.  Processing Queries over Distributed XML Databases , 2010, J. Inf. Data Manag..

[2]  Carmem S. Hara,et al.  Layering a DBMS on a DHT-Based Storage Engine , 2011, J. Inf. Data Manag..

[3]  Wei Lin,et al.  Advanced partitioning techniques for massively distributed computation , 2012, SIGMOD Conference.

[4]  Vivek R. Narasayya,et al.  Integrating vertical and horizontal partitioning into automated physical database design , 2004, SIGMOD '04.

[5]  Carlo Curino,et al.  Lookup Tables: Fine-Grained Partitioning for Distributed Databases , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[6]  Ioana Manolescu,et al.  XML processing in DHT networks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[7]  M. Tamer Özsu,et al.  Query Processing : Fragmentation , Localization and Pruning , 2010 .

[8]  Oded Shmueli,et al.  An algorithm for partitioning trees augmented with sibling edges , 2008, Inf. Process. Lett..

[9]  Tim Kraska,et al.  An evaluation of alternative architectures for transaction processing in the cloud , 2010, SIGMOD Conference.

[10]  Samuel Madden,et al.  Partitioning techniques for fine-grained indexing , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[11]  Alfredo Cuzzocrea,et al.  Fragmenting very large XML data warehouses via K-means clustering algorithm , 2009, Int. J. Bus. Intell. Data Min..

[12]  Leonidas Fegaras,et al.  XFrag: A Query Processing Framework for Fragmented XML Data , 2005, WebDB.

[13]  Carlo Curino,et al.  Schism , 2010, Proc. VLDB Endow..

[14]  Carmem S. Hara,et al.  Phoenix: A Relational Storage Component for the Cloud , 2011, 2011 IEEE 4th International Conference on Cloud Computing.

[15]  Jin Zhang,et al.  Xbase: cloud-enabled information appliance for healthcare , 2010, EDBT '10.

[16]  Shamkant B. Navathe,et al.  Vertical partitioning for database design: a graphical algorithm , 1989, SIGMOD '89.

[17]  M. Tamer Özsu,et al.  XBench - A Family of Benchmarks for XML DBMSs , 2002, EEXTT.