Database Paper Browser

Back to papers

The Complexity Of Testing Predicate Locks

Summary: NP-complete for satisfiability of predicates, even simple ones, in predicate locks. With fixed-degree relations, a polynomial-time algorithm in predicate length exists, even for field-field comparisons with offsets; satisfiable predicates have witnesses whose values are tied to the predicate constants. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2104
Venue
SIGMOD
Year
1979
Pagerank
6.4546085e-05
Overall Rank
4,098 | 71.50%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
4,840 Solving the Phantom Problem by Predicative Optimistic Concurrency Control 1983 VLDB 5.8864974e-05
5,735 A Decision Procedure for Conjunctive Query Disjointness 1989 PODS 5.3482653e-05
10,736 TreeCat: Standalone Catalog Engine for Large Data Systems 2025 VLDB 4.1945683e-05
13,000 Adaptive Predicate Managers in Database Systems 1986 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
19 Interval Hierarchies And Their Application To Predicate Files 1977 SIGMOD 0.00091625014
Previous Page 1 / 1 Next

Semantically Similar Papers