Service restrictions from February 12-22, 2026—more information on the University Library website

Result: Optimal multidimensional query processing using tree striping

Title:
Optimal multidimensional query processing using tree striping
Authors:
BERCHTOLD, S, BÖHM, C, KEIM, D. A, KRIEGEL, H.-P, XIAOWEI XU
Source:
DaWak 2000 : data warehousing and knowledge discovery (London, 4-6 September 2000)Lecture notes in computer science. 1874:244-257
Publisher Information:
Berlin: Springer, 2000.
Publication Year:
2000
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Documentation, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Sciences de l'information. Documentation, Information science. Documentation, Systèmes de recherche d'informations. Système de gestion documentaire et d'information, Information retrieval systems. Information and document management system, Systèmes de recherche d'information, Information retrieval systems, Sciences de l'information et de la communication, Information and communication sciences, Système de recherche documentaire. Système de gestion documentaire et d'information, Arbre graphe, Tree(graph), Arbol grafo, Base donnée, Database, Base dato, Fichier inverse, Inverted file, Archivo invertido, Index, Index (documentation), Indice, Modèle n dimensions, Multidimensional model, Modelo n dimensiones, Modèle théorique, Theoretical model, Modelo teórico, Question documentaire, Query, Pregunta documental, Vecteur, Vector, Traitement question, Question processing, Tree-striping
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Stb gmbh, Ulrichsplatz 6, 86150 Augsburg, Germany
University of Munich, Oettingenstr. 67, 80538 Munich, Germany
University of Halle-Wittenberg, Kurt-Mothes Str. 1, 06099 Halle (Saale), Germany
Siemens AG, Information and Communications, 81730 Munich, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=781632
Rights:
Copyright 2001 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Sciences of information and communication. Documentation

FRANCIS
Accession Number:
edscal.781632
Database:
PASCAL Archive

Further Information

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.