Database Paper Browser

Back to papers

Query Processing in Deductive Databases with Incomplete Information

Summary: Explores query processing in deductive DBs with incomplete information using Horn rules and Skolem functions. CQ can be rewritten to run on the extension despite cyclic inclusions and views; recursion with incomplete data increases complexity. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2313
Venue
SIGMOD
Year
1986
Pagerank
8.2488274e-05
Overall Rank
2,712 | 81.14%
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
1,697 A Probabilistic Framework for Vague Queries and Imprecise Information in Databases 1990 VLDB 0.00010873473
5,823 Believe It or Not: Adding Belief Annotations to Databases 2009 VLDB 5.3129967e-05
12,849 Cumulative Updates 1994 VLDB 4.1945683e-05
12,956 Partition Semantics For Incomplete Information In Relational Databases 1988 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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