We address the problem of evaluating ranked top-k queries in description logics. 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 efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge bases
Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
Straccia U
2006
Abstract
We address the problem of evaluating ranked top-k queries in description logics. 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 efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge basesFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_226217-doc_129723.pdf
solo utenti autorizzati
Descrizione: Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
Tipologia:
Versione Editoriale (PDF)
Dimensione
394 kB
Formato
Adobe PDF
|
394 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
prod_226217-doc_129724.pdf
solo utenti autorizzati
Descrizione: Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
Tipologia:
Versione Editoriale (PDF)
Dimensione
535.26 kB
Formato
Adobe PDF
|
535.26 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.
