Optimal Multidimensional Query Processing Using Tree Striping

Berchtold, Stefan; Böhm, Christian; Keim, Daniel A.; Kriegel, Hans-Peter; Xu, Xiaowei

Optimal Multidimensional Query Processing Using Tree Striping

Dateien

fulltext.pdf(223.32 KB)

Datum

2000

Autor:innen

Berchtold, Stefan

Böhm, Christian

Keim, Daniel A.

Kriegel, Hans-Peter

Xu, Xiaowei

Publikationstyp

Beitrag zu einem Sammelband

Erschienen in

Data Warehousing and Knowledge Discovery / Mohania, Mukesh et al. (Hrsg.). - Berlin : Springer, 2000. - S. 244-257

Zusammenfassung

In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalizes the well-known inverted lists and multidimensional indexing approaches. A theoretical analysis of our generalized technique shows that both, inverted lists and multidimensional indexing approaches, are far from being optimal. A consequence of our analysis is that the use of a set of multidimensional indexes provides considerable improvements over one d-dimensional index (multidimensional indexing) or d one-dimensional indexes (inverted lists). The basic idea of tree striping is to use the optimal number k of lower-dimensional indexes determined by our theoretical analysis for efficient query processing. We confirm our theoretical results by an experimental evaluation on large amounts of real and synthetic data. The results show a speed-up of up to 310% over the multidimensional indexing approach and a speed-up factor of up to 123 (12,300%) over the inverted-lists approach.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

BERCHTOLD, Stefan, Christian BÖHM, Daniel A. KEIM, Hans-Peter KRIEGEL, Xiaowei XU, 2000. Optimal Multidimensional Query Processing Using Tree Striping. In: MOHANIA, Mukesh, ed. and others. Data Warehousing and Knowledge Discovery. Berlin:Springer, pp. 244-257. Available under: doi: 10.1007/3-540-44466-1_24

BibTex

@incollection{Berchtold2000Optim-5812,
  year={2000},
  doi={10.1007/3-540-44466-1_24},
  title={Optimal Multidimensional Query Processing Using Tree Striping},
  publisher={Springer},
  address={Berlin},
  booktitle={Data Warehousing and Knowledge Discovery},
  pages={244--257},
  editor={Mohania, Mukesh},
  author={Berchtold, Stefan and Böhm, Christian and Keim, Daniel A. and Kriegel, Hans-Peter and Xu, Xiaowei}
}

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/5812">
    <dcterms:issued>2000</dcterms:issued>
    <dc:creator>Böhm, Christian</dc:creator>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: Data Warehousing and Knowledge Discovery / Mukesh Mohania ... (eds.) - Berlin: Springer, 2000, pp. 244-257</dcterms:bibliographicCitation>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:17Z</dc:date>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <dc:language>eng</dc:language>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:abstract xml:lang="eng">In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalizes the well-known inverted lists and multidimensional indexing approaches. A theoretical analysis of our generalized technique shows that both, inverted lists and multidimensional indexing approaches, are far from being optimal. A consequence of our analysis is that the use of a set of multidimensional indexes provides considerable improvements over one d-dimensional index (multidimensional indexing) or d one-dimensional indexes (inverted lists). The basic idea of tree striping is to use the optimal number k of lower-dimensional indexes determined by our theoretical analysis for efficient query processing. We confirm our theoretical results by an experimental evaluation on large amounts of real and synthetic data. The results show a speed-up of up to 310% over the multidimensional indexing approach and a speed-up factor of up to 123 (12,300%) over the inverted-lists approach.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Xu, Xiaowei</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:17Z</dcterms:available>
    <dc:creator>Kriegel, Hans-Peter</dc:creator>
    <dc:contributor>Berchtold, Stefan</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5812/1/fulltext.pdf"/>
    <dc:contributor>Böhm, Christian</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:format>application/pdf</dc:format>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5812"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Xu, Xiaowei</dc:contributor>
    <dc:contributor>Kriegel, Hans-Peter</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Berchtold, Stefan</dc:creator>
    <dcterms:title>Optimal Multidimensional Query Processing Using Tree Striping</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5812/1/fulltext.pdf"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein