Database Paper Browser

Back to papers

Deleting Completed Transactions (Extended Abstract)

Summary: Gives a necessary and sufficient condition characterizing when a conflict-graph–based scheduler can safely forget (remove) a completed transaction without violating correctness. Condition is testable in polynomial time and supports repeated application for incremental garbage collection. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
747
Venue
PODS
Year
1986
Pagerank
5.6308297e-05
Overall Rank
7,654 | 46.81%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,636 Serialization Graph Algorithms for Multiversion Concurrency Control 1988 PODS 8.3839123e-05
8,363 Reducing Recovery Constraints on Locking based Protocols 1994 PODS 5.49966e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers