DBScholar

Back to papers

Complete Approximations of Incomplete Queries

Summary: A demonstrator rewrites conjunctive queries over partially complete databases into guaranteed-complete approximations using table-completeness statements. It computes the unique most-specific generalization and bounded least-specific specializations via ASP fixpoints and logic-programming unification. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10807
Venue
VLDB
Year
2013
Pagerank
5.5077375e-05
Overall Rank
8,007 | 45.07%
DOI
10.14778/2536274.2536320

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{savkovic_vldb13,
        title = {{Complete Approximations of Incomplete Queries}},
        author = {Savkovic, Ognjen and Mirza, Paramita and Tomasi, Alex and Nutt, Werner},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {12},
        pages = {1378--1381},
        doi = {10.14778/2536274.2536320},
        url = {https://doi.org/10.14778/2536274.2536320},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
3,386 Efficient and Effective Data Imputation with Influence Functions 2022 VLDB 7.453827e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,117 Obtaining Complete Answers from Incomplete Databases 1996 VLDB 9.1434045e-05
5,616 Capturing Missing Tuples and Missing Values 2010 PODS 6.1493013e-05
5,617 Relative Information Completeness 2009 PODS 6.1493013e-05
12,404 Completeness of Queries over Incomplete Databases 2011 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers