Distributing XML with focus on parallel evaluation

Lade...
Vorschaubild
Dateien
graf.pdf
graf.pdfGröße: 246.91 KBDownloads: 216
Datum
2008
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
Databases, Information Systems, and Peer-to-Peer Computing, Sixth International Workshops, DBISP2P 2008, Auckland, New Zealand, August 23, 2008. 2008
Zusammenfassung

In contrast to relational databases the distribution of document-centric XML is not well researched. While there are some suggestions on how to split and distribute large XML documents, these approaches do not consider the parallel query evaluation. In this paper, we present and compare five different algorithms to search after suitable split nodes in a large XML document. We then describe how to distribute extractable sub-structures over a fixed number of peers and how to query these peers in parallel to retrieve the final result. In addition, we analyse the impact of our splitting algorithms with respect to scalability for two different XPath expression classes on three well-known XML data sets. We conclude this paper with an outlook on future work, including result ordering during parallel query execution and dynamic re-distribution of XML fragments to new peers due to updates.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
DBISP2P, 23. Aug. 2008, Auckland, New Zealand
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690GRAF, Sebastian, Marc KRAMIS, Marcel WALDVOGEL, 2008. Distributing XML with focus on parallel evaluation. DBISP2P. Auckland, New Zealand, 23. Aug. 2008. In: Databases, Information Systems, and Peer-to-Peer Computing, Sixth International Workshops, DBISP2P 2008, Auckland, New Zealand, August 23, 2008. 2008
BibTex
@inproceedings{Graf2008Distr-5788,
  year={2008},
  title={Distributing XML with focus on parallel evaluation},
  booktitle={Databases, Information Systems, and Peer-to-Peer Computing, Sixth International Workshops, DBISP2P 2008, Auckland, New Zealand, August 23, 2008},
  author={Graf, Sebastian and Kramis, Marc 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/5788">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:06Z</dc:date>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dc:contributor>Kramis, Marc</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5788"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:abstract xml:lang="eng">In contrast to relational databases the distribution of document-centric XML is not well researched. While there are some suggestions on how to split and distribute large XML documents, these approaches do not consider the parallel query evaluation. In this paper, we present and compare five different algorithms to search after suitable split nodes in a large XML document. We then describe how to distribute extractable sub-structures over a fixed number of peers and how to query these peers in parallel to retrieve the final result. In addition, we analyse the impact of our splitting algorithms with respect to scalability for two different XPath expression classes on three well-known XML data sets. We conclude this paper with an outlook on future work, including result ordering during parallel query execution and dynamic re-distribution of XML fragments to new peers due to updates.</dcterms:abstract>
    <dc:creator>Graf, Sebastian</dc:creator>
    <dcterms:issued>2008</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Kramis, Marc</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:06Z</dcterms:available>
    <dcterms:title>Distributing XML with focus on parallel evaluation</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <dc:language>eng</dc:language>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5788/1/graf.pdf"/>
    <dc:contributor>Graf, Sebastian</dc:contributor>
    <dcterms:bibliographicCitation>Paper, presented at: Databases, Information Systems, and Peer-to-Peer Computing, Sixth International Workshops, DBISP2P 2008, Auckland, New Zealand, August 23, 2008</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5788/1/graf.pdf"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:creator>Waldvogel, Marcel</dc:creator>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen