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.
Towards top-k query answering in deductive databases
Straccia U
2006
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_91382-doc_129774.pdf
solo utenti autorizzati
Descrizione: Towards top-k query answering in deductive databases
Tipologia:
Versione Editoriale (PDF)
Dimensione
274.88 kB
Formato
Adobe PDF
|
274.88 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
