Another Way to Find the Nearest Neighbor in Growth-Restricted Metrics (2003)
by
Kirsten Hildrum
,
John Kubiatowicz
,
Satish Rao
| Venue: | In UC Berkeley CSD ETR |
| Citations: | 8 - 5 self |
BibTeX
@TECHREPORT{Hildrum03anotherway,
author = {Kirsten Hildrum and John Kubiatowicz and Satish Rao},
title = {Another Way to Find the Nearest Neighbor in Growth-Restricted Metrics},
institution = {In UC Berkeley CSD ETR},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we give sequential and distributed dynamic data structures for finding nearest neighbors in certain growth restricted metrics.
Citations
| 1503 | Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001 |
| 928 | Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001 |
| 123 | Finding nearest neighbors in growth-restricted metrics - Karger, Ruhl |
| 105 | Navigating Nets: Simple Algorithms for Proximity Search - Krauthgamer, Lee - 2004 |
| 30 | On Name Resolution in Peer-to-Peer Networks - Li, Plaxton - 2002 |
| 2 | Locality aware networks for distributed hash tables - Land - 2003 |
