A time bound on the materialization of some recursively defined views
From MaRDI portal
Publication:578941
DOI10.1007/BF01840452zbMath0624.68095MaRDI QIDQ578941
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Horn clausesquery processingdeductive databasesrecursively defined relationsuniformly bounded recursion
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A semantic approach to optimize linear datalog programs ⋮ Nonrecursive incremental evaluation of Datalog queries ⋮ Recursive query processing in predicate-goal graph
Uses Software
Cites Work
- On recursive axioms in deductive databases
- On compiling queries in recursive first-order databases
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Equivalences among Relational Expressions
- A relational model of data for large shared data banks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A time bound on the materialization of some recursively defined views
