<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/nepomuk/from:bdarla"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/nepomuk/from:bdarla</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://webdb2008.como.polimi.it/index.php?option=com_content&amp;task=view&amp;id=75&amp;Itemid=80"/><swrc:date>Mon Jul 28 06:44:49 CEST 2008</swrc:date><swrc:title>LSH At Large -- Distributed KNN Search in High Dimensions</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dimensionality from:bdarla high knn nearest neighbor p2p search </swrc:keywords><swrc: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.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Philippe Cudre-Mauroux Karl Aberer Parisa Haghani"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Piero Fratemali Christoph Koch"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Jul 28 06:41:48 CEST 2008</swrc:date><swrc:title>LSH At Large -- Distributed KNN Search in High Dimensions</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dimensionality from:bdarla high knn nearest neighbor p2p search </swrc:keywords><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Christoph Koch Piero Fratemali"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Jul 28 06:39:42 CEST 2008</swrc:date><swrc:title>LSH At Large -- Distributed KNN Search in High Dimensions</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dimensionality from:bdarla high knn nearest neighbor p2p search </swrc:keywords><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Christiph Koch Piero Fratemali"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Jun 25 12:07:43 CEST 2007</swrc:date><swrc:booktitle>Proceedings of the 7th IEEE International Conference on Peer-to-Peer Computing</swrc:booktitle><swrc:title>Completeness Estimation of Range Queries in Structured Overlays</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>Karnstedt07Completeness from:bdarla </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Roman Schmidt Marcel Karnstedt"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
