Database Paper Browser

Back to papers

Solving the Phantom Problem by Predicative Optimistic Concurrency Control

Summary: Predicative optimistic concurrency control for predicate locking tackles the phantom problem by detecting only real conflicts. Leverages predicate-oriented language and query evaluation, avoiding disjointness tests for a concise phantom solution. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7582
Venue
VLDB
Year
1983
Pagerank
5.8864974e-05
Overall Rank
4,840 | 66.34%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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
162 Some High-level Language Constructs for Data of Type Relation 1977 SIGMOD 0.00039758372
1,739 Precision Locks 1981 SIGMOD 0.00010719584
4,098 The Complexity Of Testing Predicate Locks 1979 SIGMOD 6.4546085e-05
Previous Page 1 / 1 Next

Semantically Similar Papers