The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases.
Peter Z. ReveszPublished in: Int. J. Algebra Comput. (1998)
Keyphrases
- constraint databases
- constraint query languages
- datalog queries
- transitive closure
- computational complexity
- recursive queries
- temporal data
- expressive power
- query language
- quantifier elimination
- boolean algebra
- linear constraints
- query evaluation
- fixed point
- geographic information systems
- relational databases
- cardinality constraints
- first order logic
- np complete
- object oriented
- data structure
- database
- incomplete information
- relational algebra
- query optimization
- database theory
- markov random field
- multi dimensional
- special case