Database Paper Browser

Back to papers

Vertical Partitioning for Database Design: A Graphical Algorithm

Summary: Proposes a graphical vertical-partitioning algorithm that starts from an attribute-affinity complete graph and uses a linearly connected spanning tree to generate fragments, treating cycles as units. Claims efficiency and a cleaner alternative without arbitrary objective functions, improving prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2462
Venue
SIGMOD
Year
1989
Pagerank
8.2167214e-05
Overall Rank
2,729 | 81.02%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers