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.
Scalable and Distributed Similarity Search in Metric Spaces
Gennaro C;
2003
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_120287-doc_61939.pdf
accesso aperto
Descrizione: Scalable and Distributed Similarity Search in Metric Spaces
Tipologia:
Versione Editoriale (PDF)
Dimensione
153.49 kB
Formato
Adobe PDF
|
153.49 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
