Dynamic orthogonal range queries in OLAP

✍ Scribed by Chung Keung Poon

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 265 KB
• Volume: 296
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00741-7

✦ Synopsis

We study the problem of pre-computing auxillary information to support on-line range queries for the sum and max functions on a datacube. For a d-dimensional datacube with size n in each dimension, we propose a dynamic range max data structure with O( d (s; n)L d ) query time, O( d (s; n)L 2d n d=L ) update time and O(s d ) storage where L and s are parameters chosen by the user before the construction of the data structure such that L ∈ {1; : : : ; log n } and s is a non-negative multiple of n; and (s; n) is the functional inverse of Ackermann's function. Moreover, the data structure can be initialized in time linear to its size. There are three major techniques employed in designing the data structure, namely, a technique for trading query and update times, a technique for trading query time and storage and a technique for extending one-dimensional data structures to d-dimensional ones. Our techniques are also applicable to range queries over any semigroup and group operation, such as min, sum and count.