See this document in CiteSeerX!

Optimal Multidimensional Query Processing Using Tree Striping (2000)  (Make Corrections)  (5 citations)
Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel, Xiaowei Xu
Data Warehousing and Knowledge Discovery



  Home/Search   Context   Related

 
View or download:
dbs.informatik.uni...Stripingfinal.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  malaka.dbs.informatik.uni...list (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . 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... (Update)

Context of citations to this paper:   More

...which is essentially a data compression technique. It is applied in the VA file [Weber et al. 1998] and in the IQ tree [Berchtold et al. 2000] The basic idea is to reduce the I O time by representing the attributes not by their full 32 bit values but only with...

.... be processed is also optimized by a probability model which is derived from our cost model [BBKK 97] In our tree striping technique [BBK 00] our cost model was also applied. It was shown that for high dimensional query processing it is not optimal to use a single, high...

Cited by:   More
High-Dimensional OLAP: A Minimal Cubing Approach - Li, Han, Gonzalez (2004)   (Correct)
Dynamically Optimizing High-Dimensional Index Structures - Böhm, Kriegel (2000)   (Correct)
Database Systems Supporting Next Decade's Applications - Böhm   (Correct)

Active bibliography (related documents):   More   All
0.3:   P-Tree: A B-Tree Index for Lists - Wang, Ooi, Sung (1999)   (Correct)
0.3:   Compact Balanced Tries - Pierre Nicod Eme   (Correct)
0.1:   Planning to Gather Information - Kwok, Weld (1996)   (Correct)

Similar documents based on text:   More   All
0.7:   On Optimizing Nearest Neighbor - Queries In High-Dimensional   (Correct)
0.5:   A Cost Model for Query Processing in High-Dimensional Data Spaces - Böhm (2000)   (Correct)
0.4:   into a Relational Query Language - Daniel Keim Hans-Peter   (Correct)

Related documents from co-citation:   More   All
3:   Independent Quantization: An Index Compression Technique for High-Dimensional Da.. - Bohm, Kriegel - 1999
3:   A cost model for nearest neighbor search in high-dimensional data space (context) - Berchtold, Bohm et al. - 1997
2:   Estimating the selectivity of spatial queries using the 'correlation' fractal di.. - Belussi, Faloutsos - 1995

BibTeX entry:   (Update)

BERCHTOLD S., BHM C., KEIM D., KRIEGEL H.-P., XU X. Optimal multidimensional query processing using tree striping. Submitted for publication, 1998c. http://citeseer.ist.psu.edu/berchtold00optimal.html   More

@inproceedings{ berchtold00optimal,
    author = "Stefan Berchtold and Christian Bohm and Daniel A. Keim and Hans-Peter Kriegel and Xiaowei Xu",
    title = "Optimal Multidimensional Query Processing Using Tree Striping",
    booktitle = "Data Warehousing and Knowledge Discovery",
    pages = "244-257",
    year = "2000",
    url = "citeseer.ist.psu.edu/berchtold00optimal.html" }
Citations (may not include all citations):
283   Efficient and Effective Querying by Image Content - Faloutsos, Barber et al. - 1994
198   Organization and Maintenance of Large Ordered Indices (context) - Bayer, McCreight - 1972
162   Similarity Indexing with the SS-tree (context) - White, Jain - 1996
97   The TV-tree: An Index Structure for High-Dimensional Data - Lin, Jagadish et al. - 1995
96   der R., Seeger B.: `The R*-tree: An Efficient and Robust Acc.. (context) - Beckmann, Kriegel - 1990
84   The Grid File: An Adaptable, Symmetric Multikey File Structu.. (context) - Nievergelt, Hinterberger et al. - 1984
78   The X-tree: An Index Structure for High-Dimensional Data - Berchtold, Keim et al. - 1996
63   The R+-Tree: A Dynamic Index for Multi-Dimensional Objects - Sellis, Roussopoulos et al. - 1987
44   Toward an Analysis of Range Query Performance in Spatial Dat.. - Pagel, Six et al. - 1993
41   A comparison of spatial query processing techniques for nati.. (context) - Orenstein - 1990
33   The Buddy Tree: An Efficient and Robust Access Method for Sp.. (context) - Seeger, Kriegel - 1990

Documents on the same site (http://malaka.dbs.informatik.uni-muenchen.de/~boehm/publications/list.html):   More
The Pruning Power: Theory and Heuristics for Mining.. - Böhm, Braunmüller.. (2000)   (Correct)
A Cost Model and Index Architecture for the Similarity Join - Böhm, Kriegel (2001)   (Correct)
Epsilon Grid Order: An Algorithm for the Similarity.. - Böhm, Braunmüller.. (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC