AutoAdmin “what-if” index analysis utility
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
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
The VLDB Journal — The International Journal on Very Large Data Bases
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
DB2 design advisor: integrated automatic physical database design
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Automatic SQL tuning in oracle 10g
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Green query optimization: taming query optimization overheads through plan recycling
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Constrained physical design tuning
Proceedings of the VLDB Endowment
CORADD: correlation aware database designer for materialized views and indexes
Proceedings of the VLDB Endowment
CoPhy: a scalable, portable, and interactive index advisor for large workloads
Proceedings of the VLDB Endowment
Partitioning techniques for fine-grained indexing
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Adapting microsoft SQL server for cloud computing
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Parallel analytics as a service
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
We introduce divergent designs as a novel tuning paradigm for database systems that employ replication. A divergent design installs a different physical configuration (e.g., indexes and materialized views) with each database replica, specializing replicas for different subsets of the workload. At runtime, queries are routed to the subset of the replicas configured to yield the most efficient execution plans. When compared to uniformly designed replicas, divergent replicas can potentially execute their subset of the queries significantly faster, and their physical configurations could be initialized and maintained(updated) in less time. However, the specialization of divergent replicas limits the ability to load-balance the workload at runtime. We formalize the divergent design problem, characterize the properties of good designs, and analyze the complexity of identifying the optimal divergent design. Our paradigm captures the trade-off between load balancing among all n replicas vs. load balancing among m ≤ n specialized replicas. We develop an effective algorithm (leveraging single-node-tuning functionality) to compute good divergent designs for all the points of this trade-off. Experimental results validate the effectiveness of the algorithm and demonstrate that divergent designs can substantially improve workload performance.