Towards top-k query answering in deductive databases (Contributo in atti di convegno)

Type

• Contributo in atti di convegno (Classe)
• Prodotto della ricerca (Classe)

Label

• Towards top-k query answering in deductive databases (Contributo in atti di convegno) (literal)

Anno

• 2006-01-01T00:00:00+01:00 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

• 10.1109/ICSMC.2006.385077 (literal)

Alternative label

• Straccia U. (2006)
  Towards top-k query answering in deductive databases
  in 2006 IEEE Conference on Systems, Man, and Cybernetics, Taipei, Taiwan
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• Straccia U. (literal)

Pagina inizio

• 4873 (literal)

Pagina fine

• 4879 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url

• http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4274686 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

• In: 2006 IEEE Conference on Systems, Man, and Cybernetics (Taipei, Taiwan, 8-11 October 2006). Proceedings, pp. 4873-4879. IEEE, 2006. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto

• 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. (literal)

Note

• Google Scholar (literal)
• Scopus (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• ISTI-CNR (literal)

Titolo

• Towards top-k query answering in deductive databases (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn

• 1-4244-0099-6 (literal)

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. (literal)

Editore

• IEEE Computer Society Press (Editore)

Prodotto di

• Digital Libraries (ICT.P08.010.002) (Modulo)
• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)

Autore CNR

• UMBERTO STRACCIA (Persona)

Insieme di parole chiave

• Parole chiave di "Towards top-k query answering in deductive databases" (Insieme di parole chiave)

Incoming links:

Autore CNR di

• UMBERTO STRACCIA (Persona)

Prodotto

• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)
• Digital Libraries (ICT.P08.010.002) (Modulo)

Editore di

• IEEE Computer Society Press (Editore)

Insieme di parole chiave di

• Parole chiave di "Towards top-k query answering in deductive databases" (Insieme di parole chiave)