Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
AutoAdmin “what-if” index analysis utility
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Index Selection in Relational Databases
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
A Framework for Automating Physical Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Optimal indexing using near-minimal space
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DB2 Advisor: An Optimizer Smart Enough to Recommend its own Indexes
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A personalization framework for OLAP queries
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Self-tuning database systems: a decade of progress
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient use of the query optimizer for automated physical design
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Exact and inexact methods for selecting views and indexes for OLAP performance improvement
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A critical look at the TAB benchmark for physical design tools
ACM SIGMOD Record
Index tuning for parameterized streaming groupby queries
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
Proceedings of the 17th ACM conference on Information and knowledge management
What Can Formal Concept Analysis Do for Data Warehouses?
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Index interactions in physical design tuning: modeling, analysis, and applications
Proceedings of the VLDB Endowment
PARINDA: an interactive physical designer for PostgreSQL
Proceedings of the 13th International Conference on Extending Database Technology
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
CoPhy: a scalable, portable, and interactive index advisor for large workloads
Proceedings of the VLDB Endowment
On simplifying integrated physical database design
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Self-adaptive statistics management for efficient query processing
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Automatic selection of bitmap join indexes in data warehouses
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Divergent physical design tuning for replicated databases
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Towards fuzzy query-relaxation for RDF
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Only aggressive elephants are fast elephants
Proceedings of the VLDB Endowment
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Pruning search space of physical database design
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Mining attribute association in query predicates for access path generation
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Static and incremental selection of multi-table indexes for very large join queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering
Exploiting data access for dynamic fragmentation in data warehouse
International Journal of Intelligent Information and Database Systems
Index selection: a query pattern mining based approach
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Intelligent Decision Technologies
| Hi-index | 0.00 |
We study the index selection problem: Given a workload consisting of SQL statements on a database, and a user-specified storage constraint, recommend a set of indexes that have the maximum benefit for the given workload. We present a formal statement for this problem and show that it is computationally "hard驴 to solve or even approximate it. We develop a new algorithm for the problem which is based on treating the problem as a knapsack problem. The novelty of our approach lies in an LP (linear programming) based method that assigns benefits to individual indexes. For a slightly modified algorithm, that does more work, we prove that we can give instance specific guarantees about the quality of our solution. We conduct an extensive experimental evaluation of this new heuristic and compare it with previous solutions. Our results demonstrate that our solution is more scalable while achieving comparable quality.