Queries with Arithmetic on Incomplete Databases
Summary: Proposes a certainty measure for answers to queries with arithmetic/comparisons on incomplete databases with numerical attributes, using asymptotic volumes in Euclidean space to model lack of a uniform continuous prior. Shows the measure is well-defined, proves hardness/irrationality results, and gives randomized polynomial-time approximation schemes (multiplicative for conjunctive queries, additive for arbitrary FO queries), plus empirical validation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marco Console (University of Edinburgh)
- 2. Matthias Hofer (University of Edinburgh)
- 3. Leonid Libkin (University of Edinburgh; École Normale Supérieure (Paris), Paris Sciences et Lettres Research University)
BibTeX Citation
@inproceedings{console_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{Queries with Arithmetic on Incomplete Databases}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387666},
doi = {10.1145/3375395.3387666},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Console, Marco and Hofer, Matthias and Libkin, Leonid},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,259 | Tuple-Independent Representations of Infinite Probabilistic Databases | 2021 | PODS | 5.4574671e-05 |
| 8,837 | Coping with Incomplete Data: Recent Advances | 2020 | PODS | 5.3596619e-05 |
| 11,367 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 22 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00056204792 |
| 225 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS | 0.00024101949 |
| 4,032 | On Relational Algebra With Marked Nulls | 1984 | PODS | 6.9453392e-05 |
| 5,245 | Certain Answers Meet Zero-One Laws | 2018 | PODS | 6.3012734e-05 |
| 5,361 | Answering Queries Using Views with Arithmetic Comparisons | 2002 | PODS | 6.2484907e-05 |
| 5,624 | Answering Aggregate Queries in Data Exchange | 2008 | PODS | 6.145135e-05 |
| 6,170 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 5.9514805e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,007 | Complete Approximations of Incomplete Queries | 2013 | VLDB |
| 2 | 4,811 | Uncertainty Annotated Databases - A Lightweight Approach for Approximating Certain Answers | 2019 | SIGMOD |
| 3 | 644 | The Complexity of Query Reliability | 1998 | PODS |
| 4 | 2,117 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB |
| 5 | 6,021 | Identifying the Extent of Completeness of Query Answers over Partially Complete Databases | 2015 | SIGMOD |
| 6 | 12,404 | Completeness of Queries over Incomplete Databases | 2011 | VLDB |
| 7 | 5,245 | Certain Answers Meet Zero-One Laws | 2018 | PODS |
| 8 | 8,260 | Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds | 2021 | SIGMOD |
| 9 | 8,837 | Coping with Incomplete Data: Recent Advances | 2020 | PODS |
| 10 | 11,367 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS |