Efficiency and scalability issues in metric access methods

Dohal V D, Gennaro C, Zezula P

Index structures  Metric spaces  Bioinformatics  Sequence similarity  Similarity search 

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.

Source: STUDIES IN COMPUTATIONAL INTELLIGENCE (PRINT), pp. 235-263

Publisher: Springer-Verlag

Metrics