DBScholar

Back to papers

Completeness of Queries over Incomplete Databases

Summary: Formalizes completeness reasoning over incomplete databases via table-completeness (TC) and query-completeness (QC) statements. Characterizes TC→QC entailment, weakest completeness preconditions, complexity across query languages, and links QC entailment to query determinacy. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10495
Venue
VLDB
Year
2011
Pagerank
5.093636e-05
Overall Rank
12,404 | 14.90%
DOI
10.14778/3402707.3402715

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{razniewski_vldb11,
        title = {{Completeness of Queries over Incomplete Databases}},
        author = {Razniewski, Simon and Nutt, Werner},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {11},
        pages = {749--760},
        doi = {10.14778/3402707.3402715},
        url = {https://doi.org/10.14778/3402707.3402715},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,021 Identifying the Extent of Completeness of Query Answers over Partially Complete Databases 2015 SIGMOD 6.0050351e-05
8,007 Complete Approximations of Incomplete Queries 2013 VLDB 5.5077375e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers