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
- 2. Matthias Hofer
- 3. Leonid Libkin
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,942 | Tuple-Independent Representations of Infinite Probabilistic Databases | 2021 | PODS | 4.6089395e-05 |
| 8,802 | Coping with Incomplete Data: Recent Advances | 2020 | PODS | 4.4428211e-05 |
| 11,164 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 47 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00069691761 |
| 297 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS | 0.00028572729 |
| 4,757 | On Relational Algebra With Marked Nulls | 1984 | PODS | 5.9358967e-05 |
| 5,496 | Answering Queries Using Views with Arithmetic Comparisons | 2002 | PODS | 5.4741922e-05 |
| 5,901 | Answering Aggregate Queries in Data Exchange | 2008 | PODS | 5.2791434e-05 |
| 6,151 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 5.1805044e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 7,561 | Complete Approximations of Incomplete Queries | 2013 | VLDB | 4.7057229e-05 |
| 4,809 | Uncertainty Annotated Databases - A Lightweight Approach for Approximating Certain Answers | 2019 | SIGMOD | 5.9035874e-05 |
| 572 | The Complexity of Query Reliability | 1998 | PODS | 0.00019888988 |
| 2,331 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB | 9.019917e-05 |
| 6,271 | Identifying the Extent of Completeness of Query Answers over Partially Complete Databases | 2015 | SIGMOD | 5.1273783e-05 |
| 12,217 | Completeness of Queries over Incomplete Databases | 2011 | VLDB | 4.1905499e-05 |
| 7,944 | Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds | 2021 | SIGMOD | 4.6089395e-05 |
| 8,802 | Coping with Incomplete Data: Recent Advances | 2020 | PODS | 4.4428211e-05 |
| 11,164 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS | 4.1905499e-05 |