Similarity Grid for searching in metric spaces (Articolo in rivista)

Type

• Prodotto della ricerca (Classe)
• Articolo in rivista (Classe)

Label

• Similarity Grid for searching in metric spaces (Articolo in rivista) (literal)

Anno

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

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

• 10.1007/11549819_3 (literal)

Alternative label

• Batko M.; Gennaro C.; Zezula P. (2005)
  Similarity Grid for searching in metric spaces
  in Lecture notes in computer science
  (literal)

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

• Batko M.; Gennaro C.; Zezula P. (literal)

Pagina inizio

• 25 (literal)

Pagina fine

• 44 (literal)

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

• http://www.springerlink.com/content/7jhbab2wvxptue4v/ (literal)

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

• 3664 (literal)

Rivista

• Lecture notes in computer science (Rivista)

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

• In: Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures. pp. 25 - 44. Can Türker, Maristella Agosti, Hans-Jörg Schek (eds.). (Lecture Notes in Computer Science, vol. 3664). Berlin / Heidelberg: Springer, 2005. (literal)

Note

• Scopu (literal)
• ISI Web of Science (WOS) (literal)

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

• Masaryk University, Brno, Czech Republic, CNR-ISTI, Pisa, Masaryk University, Brno, Czech Republic (literal)

Titolo

• Similarity Grid for searching in metric spaces (literal)

Abstract

• Similarity search in metric spaces represents an important paradigm for content-based retrieval of many applications. Existing centralized search structures can speed-up retrieval, but they do not scale up to large volume of data because the response time is linearly increasing with the size of the searched file. The proposed GHT* index is a scalable and distributed structure. By exploiting parallelism in a dynamic network of computers, the GHT* achieves practically constant search time for similarity range queries in data-sets of arbitrary size. The structure also scales well with respect to the growing volume of retrieved data. Moreover, a small amount of replicated routing information on each server increases logarithmically. At the same time, the potential for interquery parallelism is increasing with the growing data-sets because the relative number of servers utilized by individual queries is decreasing. All these properties are verified by experiments on a prototype system using real-life data-sets. (literal)

Prodotto di

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

Autore CNR

• PAVEL ZEZULA (Unità di personale esterno)
• CLAUDIO GENNARO (Persona)

Insieme di parole chiave

• Keywords of "Similarity Grid for searching in metric spaces" (Insieme di parole chiave)

Incoming links:

Prodotto

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

Autore CNR di

• CLAUDIO GENNARO (Persona)
• PAVEL ZEZULA (Unità di personale esterno)

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

• Lecture notes in computer science (Rivista)

Insieme di parole chiave di

• Keywords of "Similarity Grid for searching in metric spaces" (Insieme di parole chiave)