@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
}

@inproceedings{Haghani:2008:LSH,
  added-at = {2008-07-28T06:41:48.000+0200},
  biburl = {http://www.bibsonomy.org/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk},
  editor = {Fratemali, Christoph Koch Piero},
  interhash = {6ce6eb769cbd651ed7a8d03fd4795037},
  intrahash = {a7204f03cc1883586ffef45dc89b1a34},
  keywords = {dimensionality from:bdarla high knn nearest neighbor p2p search},
  timestamp = {2008-07-28T06:41:48.000+0200},
  title = {LSH At Large -- Distributed KNN Search in High Dimensions},
  year = 2008
}

@inproceedings{Haghani:2008:LSH,
  added-at = {2008-07-28T06:39:42.000+0200},
  biburl = {http://www.bibsonomy.org/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk},
  editor = {Fratemali, Christiph Koch Piero},
  interhash = {6ce6eb769cbd651ed7a8d03fd4795037},
  intrahash = {72d4cd48bdeddce4e4cf015cb8a9a326},
  keywords = {dimensionality from:bdarla high knn nearest neighbor p2p search},
  timestamp = {2008-07-28T06:39:42.000+0200},
  title = {LSH At Large -- Distributed KNN Search in High Dimensions},
  year = 2008
}

@inproceedings{Karnstedt07Completeness,
  added-at = {2007-06-25T12:07:43.000+0200},
  author = {Karnstedt, Roman Schmidt Marcel},
  biburl = {http://www.bibsonomy.org/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk},
  booktitle = {Proceedings of the 7th IEEE International Conference on Peer-to-Peer Computing},
  interhash = {7d66c94df948ce1693e78c885c60fdc5},
  intrahash = {0ae68a9372c8e208e8c433897b37a737},
  keywords = {Karnstedt07Completeness from:bdarla},
  timestamp = {2007-06-25T12:07:43.000+0200},
  title = {Completeness Estimation of Range Queries in Structured Overlays},
  year = 2007
}