. "Zezula, Pavel" . "P(1ET100300419)" . "Batko, Michal" . . . "Similarity Grid for Searching in Metric Spaces" . . "000232268700003" . "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."@en . . . "542624" . . "Gennaro, Claudio" . . "RIV/00216224:14610/05:00013400!RIV10-AV0-14610___" . . "RIV/00216224:14610/05:00013400" . "Springer-Verlag. Heidelberg" . "[BB6441A4C55D]" . . . "Similarity Grid for Searching in Metric Spaces"@en . "20"^^ . . "2"^^ . "Berlin" . . "3-540-28711-6" . "3"^^ . "2004-06-24+02:00"^^ . "Cagliari" . . . "Similarity Grid for Searching in Metric Spaces" . "distributed data; scalable structures; similarity search; metric space"@en . . . "Similarity Grid for Searching in Metric Spaces"@en . . "Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures: 6th Thematic Workshop of the EU Network of Excellence DELOS. Revised Selected Papers. LNCS 3664" . "14610" . "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." .