Self-tuning Database Systems: A Systematic Literature Review of Automatic Database Schema Design and Tuning
Self-tuning is a feature of autonomic databases that includes the problem of automatic
schema design. It aims at providing an optimized schema that increases the overall …
schema design. It aims at providing an optimized schema that increases the overall …
Understanding TSP difficulty by learning from evolved instances
K Smith-Miles, J Van Hemert, XY Lim - … , LION 4, Venice, Italy, January 18 …, 2010 - Springer
Whether the goal is performance prediction, or insights into the relationships between
algorithm performance and instance characteristics, a comprehensive set of meta-data from …
algorithm performance and instance characteristics, a comprehensive set of meta-data from …
Discovering the suitability of optimisation algorithms by learning from evolved instances
K Smith-Miles, J van Hemert - Annals of Mathematics and Artificial …, 2011 - Springer
The suitability of an optimisation algorithm selected from within an algorithm portfolio
depends upon the features of the particular instance to be solved. Understanding the …
depends upon the features of the particular instance to be solved. Understanding the …
Automatic index selection for large-scale datalog computation
Datalog has been applied to several use cases that require very high performance on large
rulesets and factsets. It is common to create indexes for relations to improve search …
rulesets and factsets. It is common to create indexes for relations to improve search …
Data mining-based materialized view and index selection in data warehouses
K Aouiche, J Darmont - Journal of Intelligent Information Systems, 2009 - Springer
Materialized views and indexes are physical structures for accelerating data access that are
casually used in data warehouses. However, these data structures generate some …
casually used in data warehouses. However, these data structures generate some …
Automatic Database Index Tuning: A Survey
Index tuning plays a crucial role in facilitating the efficiency of data retrieval within database
systems, which adjusts index settings to optimize the database performance. Recently, with …
systems, which adjusts index settings to optimize the database performance. Recently, with …
Measuring algorithm footprints in instance space
K Smith-Miles, TT Tan - 2012 IEEE congress on evolutionary …, 2012 - ieeexplore.ieee.org
This paper proposes a new methodology to determine the relative performance of
optimization algorithms across various classes of instances. Rather than reporting …
optimization algorithms across various classes of instances. Rather than reporting …
Evolving combinatorial problem instances that are difficult to solve
JI van Hemert - Evolutionary Computation, 2006 - direct.mit.edu
This paper demonstrates how evolutionary computation can be used to acquire difficult to
solve combinatorial problem instances. As a result of this technique, the corresponding …
solve combinatorial problem instances. As a result of this technique, the corresponding …
Automatic selection of bitmap join indexes in data warehouses
K Aouiche, J Darmont, O Boussaïd… - … Conference on Data …, 2005 - Springer
The queries defined on data warehouses are complex and use several join operations that
induce an expensive computational cost. This cost becomes even more prohibitive when …
induce an expensive computational cost. This cost becomes even more prohibitive when …
Self-driving database systems: a conceptual approach
J Kossmann, R Schlosser - Distributed and Parallel Databases, 2020 - Springer
Challenges for self-driving database systems, which tune their physical design and
configuration autonomously, are manifold: Such systems have to anticipate future …
configuration autonomously, are manifold: Such systems have to anticipate future …