Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
Optimal Selection of Secondary Indexes
IEEE Transactions on Software Engineering
Data mining: concepts and techniques
Data mining: concepts and techniques
Database System Implementation
Database System Implementation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Index Selection in Relational Databases
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
DB2 Advisor: An Optimizer Smart Enough to Recommend its own Indexes
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Today's DBMSs: How autonomic are they?
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
The dawning of the autonomic computing era
IBM Systems Journal
Autonomous Query-Driven Index Tuning
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
Recommending Materialized Views and Indexes with IBM DB2 Design Advisor
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
COLT: continuous on-line tuning
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On the Selection of an Optimal Set of Indexes
IEEE Transactions on Software Engineering
On-Line Index Selection for Shifting Workloads
ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Online index selection in RDBMS by evolutionary approach
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
| Hi-index | 0.01 |
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of representative queries from the original workload. A single pass clustering algorithm with a simple and elegant selectivity based query distance metric guarantees low memory and time complexity. Experiments on two real-world database workloads show the method achieves high compression ratio without decreasing the quality of the index selection problem solutions.