Can datalog be approximated?

DOI10.1006/JCSS.1997.1528MaRDI QIDQ1376415zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient Approximations of Conjunctive Queries
• A more general theory of static approximations for conjunctive queries
• Models of approximation in databases
• A more general theory of static approximations for conjunctive queries

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• An observation on time-storage trade off
• Data independent recursion in deductive databases
• Datalog vs first-order logic
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Monadic generalized spectra
• On monadic NP vs monadic co-NP
• On the foundations of the universal relation model
• Undecidable optimization problems for database logic programs

Cited in

(1)

• Models of approximation in databases

Describes a project that uses

Uses Software

• Datalog

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

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