A formal approach to the vertical partitioning problem in distributed database design

Abstract

The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived. The objective function derived provides a basis for developing heuristic algorithms for vertical partitioning. The objective function is also useful for comparing previously proposed algorithms for vertical partitioning. The current implementation status of a testbed is indicated.<>