Physical Data Modeling for Multidimensional Access Methods

Despite the fact that the database community has proposed a vast number of indexing methods over the years, no standard physical data model has been established like it has been achieved on the conceptual and logical level. How to optimize a given data model by using various indexing methods is still the ‚trade secret‘ of the database administrators. Only recently, some approaches have been tried to make this knowledge available to the normal database user by easy to use optimization tools (e.g., AutoAdmin-Tool of MS SQL Server 7.0). In addition, physical data modeling has concentrated on one-dimensional access methods, since these were the only ones available in commercial database management systems. As multidimensional access methods (MDAMs) are making their way from the research labs into commercial products, a general physical data model should also take MDAMs into account, especially since MDAMs have a high potential to improve processing in important application domains like OLAP, Data Mining, or Archiving Systems. Our research in this field concentrates on providing rules and heuristics for optimal physical data modeling with multidimensional access methods. Currently we are focusing on the application domain of relational OLAP (ROLAP). MDAMs have a high potential in ROLAP since most queries result in multiattribute restrictions on a table [MZB99]. Arguing that physical data modeling is superfluous in the presence of MDAMs because one could just index all important attributes with one MDAM neglects the fact that the practical limits on the dimensionality of MDAMs lies around ten dimensions. As consequence, physical data modeling for MDAMs does not address the question of which index type to use in the first place, but the question of which attributes to select for indexing.

[1]  Surajit Chaudhuri,et al.  Index merging , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[2]  Rudolf Bayer The Universal B-Tree for multidimensional Indexing , 1996 .

[3]  Surajit Chaudhuri,et al.  An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server , 1997, VLDB.

[4]  Surajit Chaudhuri,et al.  AutoAdmin “what-if” index analysis utility , 1998, SIGMOD '98.

[5]  Volker Markl,et al.  Mistral - Processing Relational Queries using a Multidimensional Access Technique , 1999, Datenbank Rundbr..

[6]  Rudolf Bayer UB-Trees and UB-Cache A new Processing Paradigm for Database Systems , 1997 .

[7]  Volker Markl,et al.  Improving OLAP performance by multidimensional hierarchical clustering , 1999, Proceedings. IDEAS'99. International Database Engineering and Applications Symposium (Cat. No.PR00265).

[8]  Sunita Sarawagi Indexing OLAP Data , 1997, IEEE Data Eng. Bull..

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

[10]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.