|The OceanStore Project
A Note on Finding the Nearest Neighbor in Growth-Restricted Metrics
Symposium on Discrete Algorithms 2004
Our algorithm was inspired by the object location data structure developed by Plaxton, Rajaraman and Richa, and is similar in structure to the algorithm of Krauthgamer and Lee. It is significantly different that of Karger and Ruhl.
A distributed version of the algorithm presented here is in use as a part of Tapestry, a peer-to-peer object location system based on PRR.
[ Paper: PDF (70K), Postscript (159K), Compressed PostScript (102K) ]
Last modified on 11/13/2003 by Kris Hildrum.