DBScholar

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
2266
Venue
SIGMOD
Year
1983
Pagerank
5.6652469e-05
Overall Rank
7,236 | 50.36%
DOI
10.1145/582192.582199

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wright_sigmod83,
        title = {{On Merging Partitioned Databases}},
        author = {Wright, David D.},
        series = {{SIGMOD} '83},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582192.582199},
        url = {https://dl.acm.org/doi/10.1145/582192.582199},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
2,881 Dynamic Voting 1987 SIGMOD 8.0025526e-05
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