DBScholar

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
h27f5f97ea8827d86
Venue
SIGMOD
Year
1986
Pagerank
7.1914472e-05
Overall Rank
3,582 | 75.92%
DOI
10.1145/16894.16881

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{imielinski_sigmod86,
        title = {{Query Processing in Deductive Databases with Incomplete Information}},
        author = {Imielinski, Tomasz},
        series = {{SIGMOD} '86},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/16894.16881},
        url = {https://dl.acm.org/doi/10.1145/16894.16881},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
1,865 A Probabilistic Framework for Vague Queries and Imprecise Information in Databases 1990 VLDB 9.4818521e-05
5,713 Believe It or Not: Adding Belief Annotations to Databases 2009 VLDB 6.0216473e-05
13,332 Cumulative Updates 1994 VLDB 4.9793485e-05
13,441 Partition Semantics For Incomplete Information In Relational Databases 1988 SIGMOD 4.9793485e-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