Database Paper Browser

Back to papers

On Merging Partitioned Databases

Summary: Examines merging of partitioned distributed databases with a graph model; proves optimal merge is NP-complete. Develops graph-reduction methods to compress size, extends a subproblem, and evaluates heuristics with a probabilistic model via simulations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2204
Venue
SIGMOD
Year
1983
Pagerank
5.2481582e-05
Overall Rank
5,970 | 58.47%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,778 Dynamic Voting 1987 SIGMOD 0.00010581287
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