By Topic

Efficient Range-Sum Queries along Dimensional Hierarchies in Data Cubes

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

3 Author(s)
Lauer, T. ; Jedox AG, Freiburg ; Mai, D. ; Hagedorn, P.

Fast response to userspsila query and update requests continues to be one of the key requirements for OLAP systems. We outline the generalization of a space-efficient data structure, which makes it particularly suited for cubes with hierarchically structured dimensions. For a large class of range-sum queries - roll-up and drill-down along dimension hierarchies - the structure requires only a constant number of cell accesses per query on average, while offering an expected poly-logarithmic update performance.

Published in:

Advances in Databases, Knowledge, and Data Applications, 2009. DBKDA '09. First International Conference on

Date of Conference:

1-6 March 2009