DBScholar

Back to papers

Identifying the Extent of Completeness of Query Answers over Partially Complete Databases

Summary: Proposes completeness patterns as table-level selections to denote complete parts of databases. Adapts relational algebra to infer query-answer completeness; proves soundness; extends to instance-aware patterns; shows scalable real-data evaluation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5138
Venue
SIGMOD
Year
2015
Pagerank
6.0050351e-05
Overall Rank
6,021 | 58.70%
DOI
10.1145/2723372.2750544

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{razniewski_sigmod15,
        title = {{Identifying the Extent of Completeness of Query Answers over Partially Complete Databases}},
        author = {Razniewski, Simon and Korn, Flip and Nutt, Werner and Srivastava, Divesh},
        series = {{SIGMOD} '15},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2723372.2750544},
        url = {https://dl.acm.org/doi/10.1145/2723372.2750544},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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