Dynamic selection of indexes and views materialize with algorithm Knapsack.
Abbassi KamelTahar EzzedinePublished in: IINTEC (2019)
Keyphrases
- dynamic programming
- worst case
- cost function
- optimal solution
- high accuracy
- input data
- database
- experimental evaluation
- times faster
- learning algorithm
- improved algorithm
- detection algorithm
- theoretical analysis
- search space
- significant improvement
- knapsack problem
- upper bound
- tree structure
- multi dimensional
- convergence rate
- np hard
- preprocessing
- computational complexity
- search algorithm
- objective function
- simulated annealing
- expectation maximization
- segmentation algorithm
- optimization algorithm
- similarity measure
- convex hull
- face recognition
- database systems
- neural network