Mining Conditional Cardinality Patterns for Data Warehouse Query Optimization

Abstract. Data mining algorithms are often embedded in more complex systems, serving as the provider of data for internal decision making within these systems. In this paper we address an interesting problem of using data mining techniques for database query optimization. We introduce the concept of conditional cardinality patterns and design an algorithm to compute the required values for a given database schema. However applicable to any database system, our solution is best suited for data warehouse environments due to the special characteristics of both database schemata being used and queries being asked. We verify our proposal experimentally by running our algorithm against the state-of-the-art database query optimizer. The results of conducted experiments show that our algorithm outperforms traditional cost-based query optimizer with respect to the accuracy of cardinality estimation for a wide range of queries.

• Type: Conference
• Year: 2008
• Where: DAWAK
• Authors: Mikolaj Morzy, Marcin Krystek
• Keywords: Data Mining, Database Query, DAWAK 2008, Information Management, Query Optimizer