Vertical Partitioning Algorithms for Database Design

@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}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 420 citations. REVIEW CITATIONS