Near optimal multiple choice index selection for relational databases

DOI10.1016/S0898-1221(98)00256-9zbMath0941.68040MaRDI QIDQ1962948

T. I. Gündem

Publication date: 20 January 2000

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

zbMATH Keywords

relational databasesindex selection

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• On the Selection of an Optimal Set of Indexes

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