About: Efficiency and Scalability Issues in Metric Access Methods     Goto   Sponge   Distinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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. After a review of applications using the metric space approach in the field of Bioinformatics, the chapter provides an overview of methods used for creating index structures able to speedup retrieval. In the metric space approach, only pair-wise distances between objects are quantified, so they represent the level of dissimilarity.
  • 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. After a review of applications using the metric space approach in the field of Bioinformatics, the chapter provides an overview of methods used for creating index structures able to speedup retrieval. In the metric space approach, only pair-wise distances between objects are quantified, so they represent the level of dissimilarity. (en)
Title
  • Efficiency and Scalability Issues in Metric Access Methods
  • Efficiency and Scalability Issues in Metric Access Methods (en)
skos:prefLabel
  • Efficiency and Scalability Issues in Metric Access Methods
  • Efficiency and Scalability Issues in Metric Access Methods (en)
skos:notation
  • RIV/00216224:14330/08:00024154!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET100300419), P(GP201/07/P240)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 365471
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/08:00024154
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • similarity search; bioinformatics; scalability; centralized index structure; distributed index structure; metric space; peer-to-peer network; experimental evaluation (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D89E65CCECD5]
http://linked.open...i/riv/mistoVydani
  • Berlin, Germany
http://linked.open...vEdiceCisloSvazku
  • Studies in Computational Intelligence, vol. 85
http://linked.open...i/riv/nazevZdroje
  • Computational Intelligence in Medical Informatics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...v/pocetStranKnihy
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Zezula, Pavel
  • Dohnal, Vlastislav
  • Gennaro, Claudio
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag. (Berlin; Heidelberg)
https://schema.org/isbn
  • 978-3-540-75766-5
http://localhost/t...ganizacniJednotka
  • 14330
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software