A semantic approach to optimize linear datalog programs
From MaRDI portal
Publication:854685
DOI10.1007/s00236-006-0025-9zbMath1104.68039OpenAlexW2080339008WikidataQ113366394 ScholiaQ113366394MaRDI QIDQ854685
José R. Paramá, Nieves R. Brisaboa, Ángeles S. Places, Miguel R. Penabad
Publication date: 6 December 2006
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-006-0025-9
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A time bound on the materialization of some recursively defined views
- A semantic approach to optimize linear datalog programs
- On recursive axioms in deductive databases
- Boundedness is undecidable for datalog programs with a single recursive rule
- Preservation of integrity constraints in definite DATALOG programs
- Undecidable optimization problems for database logic programs
- A Proof Procedure for Data Dependencies
- Variations on the Common Subexpression Problem
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
- Database Theory - ICDT 2005
- Perspectives of System Informatics
This page was built for publication: A semantic approach to optimize linear datalog programs
