Publikation:

Methods and Cost Models for XPath Query Processing in Main Memory Databases

Lade...
Vorschaubild

Dateien

thesis.pdf
thesis.pdfGröße: 741.72 KBDownloads: 133

Datum

2003

Autor:innen

Rode, Henning

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

Publikationstyp
Masterarbeit/Diplomarbeit
Publikationsstatus
Published

Erschienen in

Zusammenfassung

Recent work on XPath evaluation has produced e cient relational index structures for maintaining and querying XML through a DBMS. Built on top of an relational encoding, named the XPath Accelerator, this thesis takes a closer look at its utilization within the scope of query processing. Basic XPath operations, such as axis steps and simple node tests, remain in the focus of the study. Appropriate database operations for their evaluation are introduced in the context of the main memory DBMS Monet. In those cases where the existing database operators fail to exploit the tree properties of XML data, new algorithms have been developed, designed speci cally for evaluation of XPath axes. As an important step towards cost analysis for the proposed XPath operations, result size estimation is discussed in the trade o between accuracy and expense. Di erent methods show how statistical data as well as sampling techniques can be used for estimating result sizes of simple axis steps. The generation of cost functions mainly considers the time, that the XPath operations spend on data access. Even in main memory databases, CPU processing usually gets stalled for outstanding memory fetches. Therefore, our cost functions explicitly analyze the cache usage of the operations, adopting a hierarchical memory access model. Detailed tests demonstrate the accuracy and performance of the proposed result size and cost estimation techniques.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

XPath Result Size Estimation

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690RODE, Henning, 2003. Methods and Cost Models for XPath Query Processing in Main Memory Databases [Master thesis]
BibTex
@mastersthesis{Rode2003Metho-6373,
  year={2003},
  title={Methods and Cost Models for XPath Query Processing in Main Memory Databases},
  author={Rode, Henning}
}
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/6373">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6373"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:17Z</dcterms:available>
    <dc:creator>Rode, Henning</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6373/1/thesis.pdf"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Rode, Henning</dc:contributor>
    <dcterms:issued>2003</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6373/1/thesis.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:17Z</dc:date>
    <dcterms:abstract xml:lang="eng">Recent work on XPath evaluation has produced e cient relational index structures for maintaining and querying XML through a DBMS. Built on top of an relational encoding, named the XPath Accelerator, this thesis takes a closer look at its utilization within the scope of query processing. Basic XPath operations, such as axis steps and simple node tests, remain in the focus of the study. Appropriate database operations for their evaluation are introduced in the context of the main memory DBMS Monet. In those cases where the existing database operators fail to exploit the tree properties of XML data, new algorithms have been developed, designed speci cally for evaluation of XPath axes. As an important step towards cost analysis for the proposed XPath operations, result size estimation is discussed in the trade o  between accuracy and expense. Di erent methods show how statistical data as well as sampling techniques can be used for estimating result sizes of simple axis steps. The generation of cost functions mainly considers the time, that the XPath operations spend on data access. Even in main memory databases, CPU processing usually gets stalled for outstanding memory fetches. Therefore, our cost functions explicitly analyze the cache usage of the operations, adopting a hierarchical memory access model. Detailed tests demonstrate the accuracy and performance of the proposed result size and cost estimation techniques.</dcterms:abstract>
    <dcterms:title>Methods and Cost Models for XPath Query Processing in Main Memory Databases</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
  </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
Begutachtet
Diese Publikation teilen