A time bound on the materialization of some recursively defined views

DOI10.1007/BF01840452zbMATH Open0624.68095MaRDI QIDQ578941FDOQ578941

Authors: Yannis E. Ioannidis 

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• Data independent recursion in deductive databases
• scientific article; zbMATH DE number 4080889
• scientific article; zbMATH DE number 4106311
• scientific article; zbMATH DE number 3982568
• On recursive axioms in deductive databases

zbMATH Keywords

query processingdeductive databasesHorn clausesrecursively defined relationsuniformly bounded recursion

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Computability and recursion theory (03D99)

Cites Work

• Graph theory with applications
• A relational model of data for large shared data banks
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalences among Relational Expressions
• Title not available (Why is that?)
• On recursive axioms in deductive databases
• Title not available (Why is that?)
• On compiling queries in recursive first-order databases

Cited In (9)

• A semantic approach to optimize linear datalog programs
• Title not available (Why is that?)
• Data independent recursion in deductive databases
• Recursive query processing in predicate-goal graph
• On recursive axioms in deductive databases
• A simple characterization of uniform boundedness for a class of recursions
• Nonrecursive incremental evaluation of Datalog queries
• Title not available (Why is that?)
• Recursively indefinite databases

Uses Software

• INGRES

This page was built for publication: A time bound on the materialization of some recursively defined views

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578941)