Can datalog be approximated?

DOI10.1006/jcss.1997.1528zbMath0887.68027OpenAlexW2078242294MaRDI QIDQ1376415

Surajit Chaudhuri, Phokion G. Kolaitis

Publication date: 17 December 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1528

zbMATH Keywords

Datalogabsolute approximationrelative approximation

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Models of approximation in databases

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data independent recursion in deductive databases
• An observation on time-storage trade off
• Datalog vs first-order logic
• On monadic NP vs monadic co-NP
• Undecidable optimization problems for database logic programs
• On the foundations of the universal relation model
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Monadic generalized spectra

This page was built for publication: Can datalog be approximated?