A Static Pessimistic Scheme for Handling Replicated Databases

Summary: Static pessimistic scheme for replicated DBs; on partitioning, updates commit only in a single group (acceptance set), outperforming voting. Acceptance set fixed at design time; group-encoding; optimal set via sparse 0-1 LP; feasible up to 10 nodes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2465
Venue: SIGMOD
Year: 1989
Pagerank: 4.1905499e-05
Overall Rank: 12,954 | 9.97%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Jian Tang
2. N. Natarajan

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
1,778	Dynamic Voting	1987	SIGMOD	0.00010571415

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
5,402	Replication, Consistency, and Practicality: Are These Mutually Exclusive?	1998	SIGMOD	5.5253784e-05
12,973	Commitment In A Partitioned Distributed Database	1988	SIGMOD	4.1905499e-05
3,272	Rethinking Eventual Consistency	2013	SIGMOD	7.290716e-05
12,781	1-Safe Algorithms for Symmetric Site Configurations	1997	VLDB	4.1905499e-05
961	The Case for Determinism in Database Systems	2010	VLDB	0.00015028453
3,377	Availability in Partitioned Replicated Databases (Extended Abstract)	1986	PODS	7.1610194e-05
6,932	A Fault-Tolerant Commit Protocol for Replicated Databases	1992	PODS	4.8878659e-05
5,507	Optimal Termination Protocols for Network Partitioning	1983	PODS	5.4708423e-05
12,913	A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols	1991	PODS	4.1905499e-05
3,595	Increasing Availability in Partitioned Database Systems (extended abstract)	1984	PODS	6.9343344e-05