Can Datalog be approximated?
Summary: Introduces a quantitative error notion and upper/lower-envelope constraints to study approximating recursive Datalog predicates by finite unions of CQs, contrasting absolute vs relative approximation. Proves absolute approximation impossible for unbounded Datalog, rules out constant-relative-error CQ approximations for broad unbounded classes, and gives sharp FO inapproximability for transitive closure and cycle queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,407 | Filtering with Approximate Predicates | 1998 | VLDB | 6.2133426e-05 |
| 6,312 | Type Inference for Datalog and its Application to Query Optimisation | 2008 | PODS | 5.1158809e-05 |
| 12,695 | Approximate Query Translation Across Heterogeneous Information Sources | 2000 | VLDB | 4.1945683e-05 |
| 12,792 | Combinatorial Games in Database Theory | 1995 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,545 | The Parallel Complexity of Simple Chain Queries (Extended Abstract) | 1987 | PODS | 0.0001144821 |
| 3,888 | On the Expressive Power of Datalog: Tools and a Case Study | 1990 | PODS | 6.6634475e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,907 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.933806e-05 |
| 7,560 | Complete Approximations of Incomplete Queries | 2013 | VLDB | 4.7102455e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 571 | The Complexity of Query Reliability | 1998 | PODS | 0.00019910719 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 4,442 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS | 6.186154e-05 |
| 7,884 | Finding Nonrecursive Envelopes for Datalog Predicates | 1993 | PODS | 4.6277758e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |