Can datalog be approximated?

DOI10.1006/JCSS.1997.1528zbMATH Open0887.68027OpenAlexW2078242294MaRDI QIDQ1376415FDOQ1376415

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

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

zbMATH Keywords

Datalogabsolute approximationrelative approximation

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (1)

• Models of approximation in databases

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)