A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
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 he...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2007-10-01
|
| Series: | Journal of Computer Science and Technology |
| Subjects: | |
| Online Access: | https://journal.info.unlp.edu.ar/JCST/article/view/774 |
| Summary: | 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. |
|---|---|
| ISSN: | 1666-6046 1666-6038 |