Database Paper Browser

Back to papers

Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases

Summary: Introduces Horn tables, an incomplete-information representation closed under total dependencies so dependency-driven completion stays within the Horn-table fragment. Characterizes complexity of certain/possible answers, shows positive-existential queries are PTIME (data complexity), and gives bounds for computing completions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
852
Venue
PODS
Year
1989
Pagerank
8.9815852e-05
Overall Rank
2,352 | 83.66%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
103 ULDBs: Databases with Uncertainty and Lineage 2006 VLDB 0.00049520051
468 MauveDB: Supporting Model-based User Views in Database Systems 2006 SIGMOD 0.00022407392
3,146 Handling Infinite Temporal Data 1990 PODS 7.4837887e-05
3,509 Consensus Answers for Queries over Probabilistic Databases 2009 PODS 7.0283775e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers