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)
Incoming Non-self Citations Over Time
Authors
- 1. Gösta Grahne (University of Helsinki)
BibTeX Citation
@inproceedings{grahne_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{HORN TABLES - AN EFFICIENT TOOL FOR HANDLING INCOMPLETE INFORMATION IN DATABASES}},
url = {https://dl.acm.org/doi/10.1145/73721.73728},
doi = {10.1145/73721.73728},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grahne, Gösta},
year = {1989}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 78 | ULDBs: Databases with Uncertainty and Lineage | 2006 | VLDB | 0.00036571789 |
| 408 | MauveDB: Supporting Model-based User Views in Database Systems | 2006 | SIGMOD | 0.00019008806 |
| 3,483 | Consensus Answers for Queries over Probabilistic Databases | 2009 | PODS | 7.372823e-05 |
| 4,348 | Handling Infinite Temporal Data | 1990 | PODS | 6.7507186e-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 |
|---|---|---|---|---|
| 10 | Extending the Data Base Relational Model to Capture More Meaning | 1979 | SIGMOD | 0.0007727299 |
| 947 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00013041389 |
| 1,417 | On Computing Restricted Projections of Representative Instances | 1985 | PODS | 0.00010839353 |
| 2,671 | On The Integrity Of Databases With Incomplete Information | 1986 | PODS | 8.2736086e-05 |
| 3,750 | Dependency Satisfaction in Databases with Incomplete Information | 1984 | VLDB | 7.1534069e-05 |
| 4,115 | Incomplete Information and Dependencies in Relational Databases | 1983 | SIGMOD | 6.8936288e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,235 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD |
| 2 | 5,594 | Hypothetical Datalog: Negation and Linear Recursion | 1989 | PODS |
| 3 | 12,993 | Normalizing Incomplete Databases | 1995 | PODS |
| 4 | 14,459 | Completeness Information and Its Application to Query Processing | 1986 | VLDB |
| 5 | 2,117 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB |
| 6 | 13,167 | Computing Facts in Non-Horn Deductive Systems | 1988 | VLDB |
| 7 | 344 | On the Power of Magic | 1987 | PODS |
| 8 | 1,498 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS |
| 9 | 947 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD |
| 10 | 3,512 | Query Processing in Deductive Databases with Incomplete Information | 1986 | SIGMOD |