@inproceedings{Haghani:2008:LSH,
  abstract = {We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay network. To minimize network traffic, we process queries in an incremental top-K fashion leveraging on a locality preserving mapping to the peer space. Furthermore, we consider load balancing by harnessing estimates of the resulting data mapping, which follows a normal distribution. We report on a comprehensive performance evaluation using high dimensional real-world data, demonstrating the suitability of our approach.},
  added-at = {2008-07-28T06:44:49.000+0200},
  author = {Haghani, Philippe Cudre-Mauroux Karl Aberer Parisa},
  biburl = {http://www.bibsonomy.org/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk},
  editor = {Koch, Piero Fratemali Christoph},
  interhash = {a50a4ef2bd21544bedfa99f17932afff},
  intrahash = {88e74a2c6c5f572063c5f6765be1a550},
  keywords = {dimensionality from:bdarla high knn nearest neighbor p2p search},
  timestamp = {2008-07-28T06:44:49.000+0200},
  title = {LSH At Large -- Distributed KNN Search in High Dimensions},
  url = {http://webdb2008.como.polimi.it/index.php?option=com_content&task=view&id=75&Itemid=80},
  year = 2008
}