A Methodology for Vertically Partitioning in a Multi-Relation Database Environment

• Autores: Narasimhaiah Gorla
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 7, Nº. 3, 2007 (Ejemplar dedicado a: Twenty-First Issue), págs. 217-227
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case. Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.