A metric cache for similarity search (Contributo in atti di convegno)

Type
Label
  • A metric cache for similarity search (Contributo in atti di convegno) (literal)
Anno
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1145/1458469.1458473 (literal)
Alternative label
  • Lucchese C.; Perego R.; Rabitti F.; Falchi F.; Orlando S. (2008)
    A metric cache for similarity search
    in Sixth Workshop on Large-Scale Distributed Systems for Information Retrieval, Napa Valley California, 26-30 October 2008
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Lucchese C.; Perego R.; Rabitti F.; Falchi F.; Orlando S. (literal)
Pagina inizio
  • 43 (literal)
Pagina fine
  • 50 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: LSDS-IR '08 - Sixth Workshop on Large-Scale Distributed Systems for Information Retrieval (Napa Valley California, October 30 2008). Proceedings, ACM, 2008. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: Similarity search in metric spaces is a general paradigm that can be used in several application elds. It can also be ef- fectively exploited in content-based image retrieval systems, which are shifting their target towards theWeb-scale dimen- sion. In this context, an important issue becomes the design of scalable solutions, which combine parallel and distributed architectures with caching at several levels. To this end, we investigate the design of a similarity cache that works in metric spaces. It is able to answer with exact and approximate results: even when an exact match is not present in cache, our cache may return an approximate re- sult set with quality guarantees. By conducting tests on a collection of one million high-quality digital photos, we show that the proposed caching techniques can have a signi cant impact on performance, like caching on text queries has been proved e ective for traditional Web search engines. (literal)
Note
  • Scopu (literal)
  • PuMa (literal)
  • Google Scholar (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-ISTI, Pisa, CNR-ISTI, Pisa - Dipartimento di Informatica, Università Ca' Foscari di Venezia (literal)
Titolo
  • A metric cache for similarity search (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-60558-254-2 (literal)
Abstract
  • Similarity search in metric spaces is a general paradigm that can be used in several application elds. It can also be ef- fectively exploited in content-based image retrieval systems, which are shifting their target towards theWeb-scale dimen- sion. In this context, an important issue becomes the design of scalable solutions, which combine parallel and distributed architectures with caching at several levels. To this end, we investigate the design of a similarity cache that works in metric spaces. It is able to answer with exact and approximate results: even when an exact match is not present in cache, our cache may return an approximate re- sult set with quality guarantees. By conducting tests on a collection of one million high-quality digital photos, we show that the proposed caching techniques can have a signi cant impact on performance, like caching on text queries has been proved e ective for traditional Web search engines. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Insieme di parole chiave di
data.CNR.it