Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ACM Computing Surveys (CSUR)
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Similarity join in metric spaces
ECIR'03 Proceedings of the 25th European conference on IR research
Building and Querying a P2P Virtual World
Geoinformatica
| Hi-index | 0.00 |
In this paper, we address the problem of scalable distributed similarity searching Our work is based on single-site metric space indexing algorithms They provide efficient way to perform range and nearest neighbor queries on arbitrary data in general metric spaces The metric spaces are excellent abstraction that allows comparison of very complex objects (such as audio files, DNA sequences, texts) We have exploited the SDDS (Scalable and Distributed Data Structures) paradigms and P2P (Peer to Peer) systems to form a metric space similarity searching structure in distributed environment Our proposed method is fully scalable without any centralized part and it allows performing similarity queries on stored data.