Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
Similarity search in metric databases through hashing
MULTIMEDIA '01 Proceedings of the 2001 ACM workshops on Multimedia: multimedia information retrieval
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
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Region proximity in metric spaces and its use for approximate similarity search
ACM Transactions on Information Systems (TOIS)
Processing M-trees with Parallel Resources
RIDE '98 Proceedings of the Workshop on Research Issues in Database Engineering
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
D-Index: Distance Searching Index for Metric Data Sets
Multimedia Tools and Applications
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
M-Grid: similarity searching in grid
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
A digital rights aware similarity measure for multimedia documents
Workshop on multimedia information retrieval on The many faces of multimedia semantics
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
A distributed incremental nearest neighbor algorithm
Proceedings of the 2nd international conference on Scalable information systems
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Distance browsing in distributed multimedia databases
Future Generation Computer Systems
An efficient peer-to-peer indexing tree structure for multidimensional data
Future Generation Computer Systems
A content-addressable network for similarity search in metric spaces
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
P2P-based multidimensional indexing methods: A survey
Journal of Systems and Software
Large-scale similarity data management with distributed Metric Index
Information Processing and Management: an International Journal
Reduction of distance computations in selection of pivot elements for balanced GHT structure
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
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.