Affiliation:
1. Stanford Univ., Stanford, CA
Abstract
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match” the requirements of transactions.
Vertical partitioning is applied in three contexts: a database stored on devices of a single type, a database stored in different memory levels, and a distributed database. In a two-level memory hierarchy, most transactions should be processed using the fragments in primary memory. In distributed databases, fragment allocation should maximize the amount of local transaction processing.
Fragments may be nonoverlapping or overlapping. A two-phase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information. The second phase performs cost optimization by incorporating the knowledge of a specific application environment. The algorithms presented in this paper have been implemented, and examples of their actual use are shown.
Publisher
Association for Computing Machinery (ACM)
Cited by
216 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Modified minimum spanning tree based vertical fragmentation, allocation and replication approach in distributed multimedia databases;Multimedia Tools and Applications;2022-08-05
2. Arabic Documents Clustering using Bond Energy Algorithm and Genetic Algorithm;2022 13th International Conference on Information and Communication Systems (ICICS);2022-06-21
3. A Design And Analysis Of Distributed Data Strategies To Support Large Scale;2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES);2022-05-20
4. Netherite;Proceedings of the VLDB Endowment;2022-04
5. 60 Years of Databases (part three);PROBLEMS IN PROGRAMMING;2022-03