DBScholar

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
2524
Venue
SIGMOD
Year
1989
Pagerank
8.1135051e-05
Overall Rank
2,797 | 80.82%
DOI
10.1145/67544.66966

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{navathe_sigmod89,
        title = {{Vertical Partitioning for Database Design: A Graphical Algorithm}},
        author = {Navathe, Shamkant B. and Ra, Minyoung},
        series = {{SIGMOD} '89},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/67544.66966},
        url = {https://dl.acm.org/doi/10.1145/67544.66966},
        year = {1989}
}

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