DocumentCode :
2267302
Title :
The Ra*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-data
Author :
Jurgens, Marcus ; Lenz, Hans-J
Author_Institution :
Inst. of Comput. Sci., Freie Univ. Berlin, Germany
fYear :
1998
fDate :
25-28 Aug 1998
Firstpage :
186
Lastpage :
191
Abstract :
OLAP applications make use of fast indexes and materialization of data. Most research treats just one topic. Either the materialized values or the design of index structures are considered. The paper examines a possible combination of both techniques. The R* tree is taken as an example of a multidimensional index structure. Aggregated data is stored in the inner nodes of the index structure in addition to the references to the successor nodes. We describe how this mechanism works in detail and present results of performance evaluation
Keywords :
query processing; tree data structures; trees (mathematics); very large databases; OLAP applications; OLAP data; Ra*-tree; aggregated data; data materialization; fast indexes; improved R*-tree; index structures; inner nodes; materialized; materialized values; multi dimensional index structure; performance evaluation; range queries; successor nodes; Cost accounting; Data analysis; Data warehouses; Databases; Delay; Econometrics; Identity-based encryption; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Database and Expert Systems Applications, 1998. Proceedings. Ninth International Workshop on
Conference_Location :
Vienna
Print_ISBN :
0-8186-8353-8
Type :
conf
DOI :
10.1109/DEXA.1998.707401
Filename :
707401
Link To Document :
بازگشت