Towards Top-k Query Answering in Deductive Databases.
In Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics (SMC-06), 2006.
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.