System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Aspects of a trigger subsystem in an integrated database system
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Simple rational guidance for chopping up transactions
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Transaction chopping: algorithms and performance studies
ACM Transactions on Database Systems (TODS)
Locking Expressions for Increased Database Concurrency
Journal of the ACM (JACM)
The complexity of testing predicate locks
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Application of sub-predicate tests in database systems
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Processing conjunctive predicates and queries
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 0.00 |
Predicates are used extensively in modern database systems for purposes ranging from user specification of associative accesses to data, to user-invisible system control functions such as concurrency control and data distribution. Collections of predicates, or predicate files, must be maintained and accessed efficiently. This paper describes a dynamic index, called an interval hierarchy, which supports several important retrieval operations on files of simple conjunctive predicates. Search and maintenance algorithms for interval hierarchies are given. For a file of n predicates, typical of the kind expected in practice, these algorithms require time equal to &Ogr;(log n).