Towards Top-k Query Answering in Deductive Databases

Umberto Straccia
2006 2006 IEEE International Conference on Systems, Man and Cybernetics  
In this paper we address a novel issue for deductive databases with huge data repositories, namely the problem of evaluating ranked top-k queries. The problem occurs whenever we allow queries such as "find cheap hotels close to the conference location" in which fuzzy predicates like cheap and close occur. We show how to compute efficiently the top-k answers of conjunctive queries with fuzzy predicates.
doi:10.1109/icsmc.2006.385077 dblp:conf/smc/Straccia06 fatcat:esh75xln5vefdnz36hut33teru