Vertical Partitioning Algorithms for Database Design

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… (More)
DOI: 10.1145/1994.2209

Topics

16 Figures and Tables

Statistics

0102030'88'91'94'97'00'03'06'09'12'15'18
Citations per Year

386 Citations

Semantic Scholar estimates that this publication has 386 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Navathe1984VerticalPA, title={Vertical Partitioning Algorithms for Database Design}, author={Shamkant B. Navathe and Stefano Ceri and Gio Wiederhold and Jinglie Dou}, journal={ACM Trans. Database Syst.}, year={1984}, volume={9}, pages={680-710} }