A survey on OLAP

Online analytical processing is to-days major database technology that has completely changed the face of decision support systems. Many of the enterprise real-time analytical solutions are provided using most advanced OLAP methods. In this paper, we have presented the overview of the various OLAP technologies and their access paths. The focus of this paper is on OLAP in distributed scenario, where we pinned on the drawback of OLAPs natural indexing search. We designed a new translated lattice called the pchrome lattice, whose nodes are binary. We implemented the natural indexing on this translated lattice and showed a drastic reduce in indexing search space, search time and distributed communication cost.

[1]  Jiawei Han,et al.  Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration , 2003, Very Large Data Bases Conference.

[2]  Howard J. Karloff,et al.  On the complexity of the view-selection problem , 1999, PODS '99.

[3]  Jeffrey F. Naughton,et al.  An array-based algorithm for simultaneous multidimensional aggregates , 1997, SIGMOD '97.

[4]  Patrick E. O'Neil,et al.  Improved query performance with variant indexes , 1997, SIGMOD '97.

[5]  Arie Shoshani,et al.  Compressing bitmap indexes for faster search operations , 2002, Proceedings 14th International Conference on Scientific and Statistical Database Management.

[6]  Jeffrey Scott Vitter,et al.  Approximate computation of multidimensional aggregates of sparse data using wavelets , 1999, SIGMOD '99.

[7]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[8]  Jeffrey D. Ullman,et al.  Index selection for OLAP , 1997, Proceedings 13th International Conference on Data Engineering.

[9]  Raymond T. Ng,et al.  Iceberg-cube computation with PC clusters , 2001, SIGMOD '01.

[10]  Narasimhaiah Gorla,et al.  Features to consider in a data warehousing system , 2003, CACM.

[11]  Jeffrey F. Naughton,et al.  On the Computation of Multidimensional Aggregates , 1996, VLDB.

[12]  Viswanath Poosala,et al.  Fast approximate query answering using precomputed statistics , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[13]  Wolfgang Lehner,et al.  On solving the view selection problem in distributed data warehouse architectures , 2003, 15th International Conference on Scientific and Statistical Database Management, 2003..

[14]  Surajit Chaudhuri,et al.  Database Technology for Decision Support Systems , 2001, Computer.

[15]  Rudolf Bayer,et al.  The Universal B-Tree for Multidimensional Indexing: general Concepts , 1997, WWCA.

[16]  Panos Kalnis,et al.  Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.

[17]  Alejandro P. Buchmann,et al.  Encoded bitmap indexing for data warehouses , 1998, Proceedings 14th International Conference on Data Engineering.

[18]  Jiawei Han,et al.  High-Dimensional OLAP: A Minimal Cubing Approach , 2004, VLDB.

[19]  Raghu Ramakrishnan,et al.  Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.

[20]  Elena Baralis,et al.  Materialized Views Selection in a Multidimensional Database , 1997, VLDB.

[21]  Su Yong.  Automatic Selection of Bitmap Join Indexes in Data Warehouses , 2007 .

[22]  Helen Hasan,et al.  Using OLAP and multidimensional data for decision making , 2001 .

[23]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.