Bringing Efficient Advanced Queries to Distributed Hash Tables

Cite This

Files in this item

Checksum: MD5:04f0230edb8ba2c664aa07c928d1b18d

BAUER, Daniel, Paul HURLEY, Roman PLETKA, Marcel WALDVOGEL, 2004. Bringing Efficient Advanced Queries to Distributed Hash Tables. 29th Annual IEEE International Conference on Local Computer Networks. LCN 2004. Tampa, FL, USA. In: 29th Annual IEEE International Conference on Local Computer Networks. IEEE (Comput. Soc.), pp. 6-14. ISBN 0-7695-2260-2. Available under: doi: 10.1109/LCN.2004.32

@inproceedings{Bauer2004Bring-6361, title={Bringing Efficient Advanced Queries to Distributed Hash Tables}, year={2004}, doi={10.1109/LCN.2004.32}, isbn={0-7695-2260-2}, publisher={IEEE (Comput. Soc.)}, booktitle={29th Annual IEEE International Conference on Local Computer Networks}, pages={6--14}, author={Bauer, Daniel and Hurley, Paul and Pletka, Roman and Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Pletka, Roman</dc:creator> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:abstract xml:lang="eng">Interest in distributed storage is fueled by demand for reliability and resilience combined with ubiquitous availability. Peer-to-peer (P2P) storage networks are known for their decentralized control, self-organization, and adaptation. Advanced searching for documents and resources remains an open problem. The flooding approach favored by some P2P networks is ineffiencient in resource usage, but more scalable and resource-efficient solutions based on Distributed Hash Tables (DHT) lack in query expressiveness and flexibility. In this paper, we address this issue and introduce new efficient, scalable, and completely distributed methods that strive to keep resource consumption by queries and index information as low as possible. We describe how to improve the handling of multiple subqueries combined through boolean set operators. The need for these operators is intensified by applications to go beyond simple exact keyword matches. We discuss, optimize, and analyze appropriate extensions to support range and prefix matching in DHTs.</dcterms:abstract> <dcterms:rights rdf:resource=""/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="">2011-03-24T16:12:12Z</dcterms:available> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Bauer, Daniel</dc:contributor> <dc:creator>Waldvogel, Marcel</dc:creator> <dcterms:title>Bringing Efficient Advanced Queries to Distributed Hash Tables</dcterms:title> <dc:date rdf:datatype="">2011-03-24T16:12:12Z</dc:date> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Pletka, Roman</dc:contributor> <dc:creator>Hurley, Paul</dc:creator> <dcterms:bibliographicCitation>First publ. as: Conference Paper IEEE LCN November 2004</dcterms:bibliographicCitation> <dcterms:issued>2004</dcterms:issued> <dc:creator>Bauer, Daniel</dc:creator> <dc:format>application/pdf</dc:format> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:hasBitstream rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Hurley, Paul</dc:contributor> <dcterms:hasPart rdf:resource=""/> <bibo:uri rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

bauer04bringing.pdf 407

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


My Account