The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Interval hierarchies and their application to predicate files
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Complexity of Computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Aspects of a trigger subsystem in an integrated database system
ICSE '76 Proceedings of the 2nd international conference on Software engineering
The management of changing types in an object-oriented database
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
A decision procedure for conjunctive query disjointness
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
Maintaining consistency in a database with changing types
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
Design and Implementation of a Semantic Query Optimizer
IEEE Transactions on Knowledge and Data Engineering
Solving the Phantom Problem by Predicative Optimistic Concurrency Control
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Adaptive Predicate Managers in Database Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Transaction Model for XML Databases
World Wide Web
Processing conjunctive predicates and queries
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Brief announcement: tree decomposition for faster concurrent data structures
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
The problem of testing predicates for satisfiability arises in several aspects of database systems such as the use of predicate locks in concurrency control [7]. Such problems are NP-complete even for "simple predicates", i.e. predicates consisting of Boolean combinations of comparisons between a field of a tuple and a constant. However, when the relations referred to by the predicates are of fixed degree, there is an algorithm whose runtime is bounded by a polynomial in the length of the predicate. This is true not only for "simple predicates" but also for predicates containing comparisons between a field and another field, possibly offset by a constant. The proofs involve showing that if a predicate is satisfiable, then it is satisfiable by a tuple whose field values are related to constants occurring in the predicate.