Vertical fragmentation of XML data warehouses using frequent path sets

  • Authors:
  • Doulkifli Boukraâ;Omar Boussaïd;Fadila Bentayeb

  • Affiliations:
  • High School of Computer Science, Oued-Smar, Algiers;Lumière University - Lyon, avenue Pierre Mendés-France, Bron Cedex;Lumière University - Lyon, avenue Pierre Mendés-France, Bron Cedex

  • Venue:
  • DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Horizontal and vertical fragmentation have been intensively studied for relational and object databases and recently for XML data. However, little work has been done on XML warehouses. In this paper, we address the problem of vertical fragmentation of XML Warehouses. We use Association Rules to partition and cluster frequent path sets into fragments. In addition, at the schema level, we address and solve the problem of reconstructing the original non-fragmented schema to ensure the fragmentation reversibility. At the data level, we propose a data organization within fragments to optimize joint operations. Finally, we present implementation details and show the benefits of our approach over the non-fragmented schema.