Bringing Efficient Advanced Queries to Distributed Hash Tables

Bauer, Daniel; Hurley, Paul; Pletka, Roman; Waldvogel, Marcel

Bringing Efficient Advanced Queries to Distributed Hash Tables

Dateien

bauer04bringing.pdfGröße: 185.33 KBDownloads: 469

Datum

2004

Autor:innen

Bauer, Daniel

Hurley, Paul

Pletka, Roman

Waldvogel, Marcel

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

29th Annual IEEE International Conference on Local Computer Networks. IEEE (Comput. Soc.), 2004, pp. 6-14. ISBN 0-7695-2260-2. Available under: doi: 10.1109/LCN.2004.32

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

29th Annual IEEE International Conference on Local Computer Networks. LCN 2004, Tampa, FL, USA

Zitieren

ISO 690

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.), 2004, pp. 6-14. ISBN 0-7695-2260-2. Available under: doi: 10.1109/LCN.2004.32

BibTex

@inproceedings{Bauer2004Bring-6361,
  year={2004},
  doi={10.1109/LCN.2004.32},
  title={Bringing Efficient Advanced Queries to Distributed Hash Tables},
  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:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6361">
    <dc:contributor>Pletka, Roman</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:format>application/pdf</dc:format>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6361/1/bauer04bringing.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:12Z</dc:date>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Pletka, Roman</dc:creator>
    <dc:language>eng</dc:language>
    <dc:contributor>Bauer, Daniel</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Bringing Efficient Advanced Queries to Distributed Hash Tables</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:12Z</dcterms:available>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Hurley, Paul</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6361/1/bauer04bringing.pdf"/>
    <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>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6361"/>
    <dc:creator>Hurley, Paul</dc:creator>
    <dcterms:bibliographicCitation>First publ. as: Conference Paper IEEE LCN November 2004</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:issued>2004</dcterms:issued>
    <dc:creator>Bauer, Daniel</dc:creator>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja