Database Paper Browser

Back to papers

Database Partitioning In A Cluster Of Processors

Summary: Partitioning a database across a processor cluster is studied using an assumed scheduling algorithm to estimate inter-processor costs for distributed transactions. Formulates the allocation problem, proves intrinsic complexity, and presents greedy first-fit heuristics with analysis. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7603
Venue
VLDB
Year
1983
Pagerank
0.00015236447
Overall Rank
932 | 93.52%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
8 Extending the Data Base Relational Model to Capture More Meaning 1979 SIGMOD 0.0015385917
Previous Page 1 / 1 Next

Semantically Similar Papers