Page 222 -
P. 222
11-ch04-125-186-9780123814791
3:17 Page 185
2011/6/1
HAN
#61
4.8 Bibliographic Notes 185
join index method to speed up OLAP-based query processing. A discussion of the per-
formance of bitmapping and other nontraditional index techniques is given in O’Neil
and Quass [OQ97].
For work regarding the selection of materialized cuboids for efficient OLAP query
processing, see, for example, Chaudhuri and Dayal [CD97]; Harinarayan, Rajaraman,
and Ullman [HRU96]; and Sristava et al. [SDJL96]. Methods for cube size estimation
+
can be found in Deshpande et al. [DNR 97], Ross and Srivastava [RS97], and Beyer and
Ramakrishnan [BR99]. Agrawal, Gupta, and Sarawagi [AGS97] proposed operations for
modeling multidimensional databases. Methods for answering queries quickly by online
aggregation are described in Hellerstein, Haas, and Wang [HHW97] and Hellerstein
+
et al. [HAC 99]. Techniques for estimating the top N queries are proposed in Carey
and Kossman [CK98] and Donjerkovic and Ramakrishnan [DR99]. Further studies on
intelligent OLAP and discovery-driven exploration of data cubes are presented in the
bibliographic notes in Chapter 5.