By Topic

The Ra*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jurgens, M. ; Inst. of Comput. Sci., Freie Univ. Berlin, Germany ; Lenz, H.-J.

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

Published in:

Database and Expert Systems Applications, 1998. Proceedings. Ninth International Workshop on

Date of Conference:

25-28 Aug 1998