PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Straccia U. Towards top-k query answering in deductive databases. In: 2006 IEEE Conference on Systems, Man, and Cybernetics (Taipei, Taiwan, 8-11 October 2006). Proceedings, pp. 4873 - 4879. IEEE, 2006.
 
 
Abstract
(English)
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.
Subject Logic programming
Top-k query answering
I.2.4 Knowledge Representation Formalisms and Methods (F.4.1)


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional