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

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:995773a7ef8c3c62dd9ce07b3a30dc93

RODE, Henning, 2003. Methods and Cost Models for XPath Query Processing in Main Memory Databases [Master thesis]

@mastersthesis{Rode2003Metho-6373, title={Methods and Cost Models for XPath Query Processing in Main Memory Databases}, year={2003}, author={Rode, Henning} }

<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/rdf/resource/123456789/6373"> <dc:creator>Rode, Henning</dc:creator> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6373"/> <dcterms:issued>2003</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:17Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:17Z</dc:date> <dc:format>application/pdf</dc:format> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6373/1/thesis.pdf"/> <dcterms:title>Methods and Cost Models for XPath Query Processing in Main Memory Databases</dcterms:title> <dc:contributor>Rode, Henning</dc:contributor> <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> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>deposit-license</dc:rights> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6373/1/thesis.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

thesis.pdf 88

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto