Bounded Ignorance in Replicated Systems
Summary: Proposes N-ignorant transactions: each transaction may be unaware of results from up to N prior transactions, trading bounded integrity-constraint violations for up to N+1× higher concurrency versus serializability. Presents algorithms and state-space methods to compute worst-case reachable violations for a given N. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,929 | Efficient Numerical Error Bounding for Replicated Network Services | 2000 | VLDB | 0.00010060709 |
| 3,300 | Distributed Algorithms For Dynamic Replication Of Data | 1992 | PODS | 7.2516673e-05 |
| 5,352 | Cache-and-Query for Wide Area Sensor Databases | 2003 | SIGMOD | 5.5528053e-05 |
| 12,907 | High Throughput Escrow Algorithms for Replicated Databases (Extended Abstract) | 1992 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 785 | Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network | 1982 | PODS | 0.0001663481 |
| 1,753 | Formal Model of Correctness Without Serializability | 1988 | SIGMOD | 0.00010665163 |
| 2,284 | Knowledge-based Integrity Constraint Validation | 1986 | VLDB | 9.1118342e-05 |
| 2,662 | A Formal Approach to Recovery by Compensating Transactions | 1990 | VLDB | 8.3579539e-05 |
Previous
Page 1 / 1
Next