The Restricted and Bounded Fixpoint Closures of the Nested Relational Algebra are Equivalent.
Marc GyssensDan SuciuDirk Van GuchtPublished in: DBPL (1995)
Keyphrases
- relational algebra
- fixpoint
- nested relational
- transitive closure
- logic programs
- recursive queries
- deductive databases
- relational model
- expressive power
- normal form
- query language
- data model
- relational database systems
- finite state machines
- aggregate functions
- first order logic
- relational calculus
- horn clauses
- complex objects
- sql queries
- stable models
- datalog programs
- functional dependencies
- integrity constraints
- logic programming
- query evaluation
- data structure
- database technology
- nonmonotonic reasoning
- model checking
- expert systems