Near optimal multiple choice index selection for relational databases

DOI10.1016/S0898-1221(98)00256-9MaRDI QIDQ1962948zbMATH OpenFDO

Authors T. I. Gündem

Publication date 20 January 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(98)00256-9

zbMATH Keywords

index selectionrelational databases

Mathematics Subject Classification ID

Database theory (68P15) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4213430
• On the selection of secondary indices in relational databases
• scientific article; zbMATH DE number 3887116
• The index selection problem with configurations and memory limitation: a scatter search approach
• A genetic algorithm for the index selection problem

Cites work

• A statistical model for estimating the number of records in a relational database
• Estimating block accesses in database organizations
• Fast Approximation Algorithms for Knapsack Problems
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• On the Selection of an Optimal Set of Indexes

Cited in

(5)

• The index selection problem with configurations and memory limitation: a scatter search approach
• scientific article; zbMATH DE number 3887116 (Why is no real title available?)
• scientific article; zbMATH DE number 4213430 (Why is no real title available?)
• On the selection of secondary indices in relational databases
• A genetic algorithm for the index selection problem

This page was built for publication: Near optimal multiple choice index selection for relational databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962948)