Database Paper Browser

Back to papers

The Complexity of Reliable Concurrency Control

Summary: Defines schedule reliability when active transactions may abort and their steps be removed/reordered, deriving necessary conditions (e.g., forbid reads of writes that can be lost) that strengthen classical serializability. Provides a complexity-theoretic study of checking/enforcing reliability, relating to view/conflict-serializability and pinpointing inherent hardness and useful tractable fragments. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
739
Venue
PODS
Year
1985
Pagerank
-
Overall Rank
14,267 | 0.75%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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