The workload you have, the workload you would like

ABSTRACT

Real data warehouse workloads are often too large and complex to be directly optimized using the algorithms proposed in the literature for view materialization and indexing. In this paper we propose the idea of profile as an instrument for summarizing the workload features in order to help the designer to make the right choices. The ability of the profile to characterize a workload is then exploited to move backward using it as an input for an algorithm that generates a set of queries presenting the desired features. The algorithm proposed is finally used for creating the workloads necessary for testing the correspondence between different profiles and the results of optimization.

REFERENCES

• 1: Elena Baralis , Stefano Paraboschi , Ernest Teniente, Materialized Views Selection in a Multidimensional Database, Proceedings of the 23rd International Conference on Very Large Data Bases, p.156-165, August 25-29, 1997
• 2: Alfonso F. Cárdenas, Analysis and performance of inverted data base structures, Communications of the ACM, v.18 n.5, p.253-263, May 1975 [doi>10.1145/360762.360766]
• 3: A. Ghosh, J. Parikh, V.S. Sengar and J. R. Haritsa. Plan Selection Based on Query Clustering, In Proc. 28th VLDB, Hong Kong, China, 2002.
• 4: M. Golfarelli. Handling large workloads by profiling and clustering. To appear in Proc. 5th DaWaK 2003, Prague, 2003.
• 5: M. Golfarelli, S. Rizzi and E. Saltarelli. Index selection for data warehousing. In Proc. DMDW'2002, Toronto, Canada, pp. 33--42, 2002.
• 6: Ashish Gupta , Venky Harinarayan , Dallan Quass, Aggregate-Query Processing in Data Warehousing Environments, Proceedings of the 21th International Conference on Very Large Data Bases, p.358-369, September 11-15, 1995
• 7: Thomas P. Nadeau , Toby J. Teorey, Achieving scalability in OLAP materialized view selection, Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, p.28-34, November 08-08, 2002, McLean, Virginia, USA [doi>10.1145/583890.583895]
• 8: S. Rizzi and E. Saltarelli. View materialization vs. Indexing: balancing space constraints in Data Warehouse Design. To appear in Proc. CAISE'03, Austria, 2003.
• 9: Timos K. Sellis, Global query optimization, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.191-205, May 28-30, 1986, Washington, D.C., United States
• 10: Dimitri Theodoratos , Mokrane Bouzeghoub, A general framework for the view selection problem for data warehouse design and evolution, Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP, p.1-8, November 06-11, 2000, McLean, Virginia, United States [doi>10.1145/355068.355309]
• 11: Transaction Processing Performance Council. TPC Benchmark H (Decision Support) Standard Specification, Revision 1.1.0, 1998, http://www.tpc.org.
• 12: Query clustering using user logs, ACM Transactions on Information Systems (TOIS), v.20 n.1, p.59-81, January 2002 [doi>10.1145/503104.503108]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.7 Database Administration

General Terms:
Algorithms, Design, Performance

Keywords:
clustering, logical design optimization, statistical indicators