PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Batko M., Gennaro C., Zezula P. Similarity Grid for searching in metric spaces. Can Türker, Maristella Agosti, Hans-Jörg Schek (eds.). (Lecture Notes in Computer Science, vol. 3664). Berlin / Heidelberg: Springer, 2005.
 
 
Abstract
(English)
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.
URL: http://www.springerlink.com/content/22vv26wu1lye/?p=9d6b4c4db14d4f36a7f7b3c13b5a67f3&pi=0
DOI: 10.1007/11549819_3
Subject Grid
Similarity Search
Metric Space
H.3.3 Information Search and Retrieval
H.3.4 Systems and Software


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional