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: 738
Venue: PODS
Year: 1985
Pagerank: -
Overall Rank: 14,468 | 0.74%
DOI: 10.1145/325405.325445

Incoming Non-self Citations Over Time

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

Authors

1. Christos H. Papadimitriou (National Technical University of Athens; Stanford University)
2. Mihalis Yannakakis (AT&T; National Technical University of Athens)

BibTeX Citation

@inproceedings{papadimitriou_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{The Complexity of Reliable Concurrency Control}},
        url = {https://dl.acm.org/doi/10.1145/325405.325445},
        doi = {10.1145/325405.325445},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Papadimitriou, Christos H. and Yannakakis, Mihalis},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,450	Formal Model of Correctness Without Serializability	1988	SIGMOD
2	4,176	An Abstract Model of Database Concurrency Control Algorithms	1983	SIGMOD
3	9,097	On Correctness of Non-serializable Executions	1993	PODS
4	14,477	Maximal Concurrency By Locking	1984	PODS
5	3,384	Towards a Unified Theory of Concurrency Control and Recovery	1993	PODS
6	695	An Optimality Theory of Concurrency Control for Databases	1979	SIGMOD
7	9,909	Reliable Scheduling of Database Transactions for Unreliable Systems	1984	PODS
8	12,877	On Herbrand Semantics and Conflict Serializability of Read-Write Transactions (Extended Abstract)	2000	PODS
9	13,209	A semantic approach to correctness of concurrent transaction executions	1985	PODS
10	11,128	When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control	2024	PODS