Using History Information to Process Delayed Database Updates
Summary: Algorithm for processing out-of-order updates in a replicated DB uses a RW history to preserve consistency. On arrival of a new update, higher-timestamped reads are undone and reexecuted to avoid cascading; a relational prototype demonstrates it. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 796 | Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases | 1999 | VLDB | 0.00016595815 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 504 | Designing DBMS Support for the Temporal Dimension | 1984 | SIGMOD | 0.0002151017 |
| 787 | Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network | 1982 | PODS | 0.00016652167 |
| 3,697 | Updating Replicated Data During Communications Failures | 1985 | VLDB | 6.8343437e-05 |
Previous
Page 1 / 1
Next