Efficiency and scalability issues in metric access methods (Contributo in volume (capitolo o saggio))

Type
Label
  • Efficiency and scalability issues in metric access methods (Contributo in volume (capitolo o saggio)) (literal)
Anno
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/978-3-540-75767-2_12 (literal)
Alternative label
  • Dohal V., D.; Gennaro C.; Zezula P. (2008)
    Efficiency and scalability issues in metric access methods
    Springer-Verlag, Berlin (Germania) in COMPUTATIONAL INTELLIGENCE IN MEDICAL INFORMATICS, 2008
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Dohal V., D.; Gennaro C.; Zezula P. (literal)
Pagina inizio
  • 235 (literal)
Pagina fine
  • 263 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#citta
  • Berlin / Heidelberg (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.springerlink.com/content/j783546183204201/ (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • COMPUTATIONAL INTELLIGENCE IN MEDICAL INFORMATICS (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
  • 85 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: Computational Intelligence in Medical Informatics. pp. 235 - 263. Kelemen Arpad, Abraham Ajith, Liang Yulan (eds.). (Studies in Computational Intelligence, vol. 85). Berlin / Heidelberg: Springer, 2008. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • The metric space paradigm has recently received attention as an important model of similarity in the area of Bioinformatics. Numerous techniques have been proposed to solve similarity (range or nearest-neighbor) queries on collections of data from metric domains. Though important representatives are outlined, this chapter is not trying to substitute existing comprehensive surveys. The main objective is to explain and prove by experiments that similarity searching is typically an expensive process which does not easily scale to very large volumes of data, thus distributed architectures able to exploit parallelism must be employed. (literal)
Note
  • Scopu (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
  • Efficiency and scalability issues in metric access methods (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#inCollana
  • Computational Intelligence in Medical Informatics (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-3-540-75766-5 (literal)
Abstract
  • The metric space paradigm has recently received attention as an important model of similarity in the area of Bioinformatics. Numerous techniques have been proposed to solve similarity (range or nearest-neighbor) queries on collections of data from metric domains. Though important representatives are outlined, this chapter is not trying to substitute existing comprehensive surveys. The main objective is to explain and prove by experiments that similarity searching is typically an expensive process which does not easily scale to very large volumes of data, thus distributed architectures able to exploit parallelism must be employed. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


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