Loading...
Please wait, while we are loading the content...
Similar Documents
Scalable and distributed similarity search in metric spaces.
| Content Provider | CiteSeerX |
|---|---|
| Author | Batko, Michal Gennaro, Claudio Zezula, Pavel |
| Abstract | In this paper we propose a new access structure, called GHT*, based on generalized hyperplane tree (GHT) and distributed dynamic hashing (DDH) techniques. GHT * is a distributed structure which allows to perform range search in a metric space according to a distance function d. The structure does not require a central directory and it is able to gracefully scale through splits of one bucket at a time. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Distance Function New Access Structure Range Search Generalized Hyperplane Tree Central Directory Dynamic Hashing Distributed Similarity Search Distributed Structure Metric Space |
| Content Type | Text |
| Resource Type | Article |
