On the selection of secondary indices in relational databases

Share/Save/Bookmark

Choenni, Sunil and Blanken, Henk M. and Chang, Thiel (1993) On the selection of secondary indices in relational databases. Data & Knowledge Engineering, 11 (3). pp. 207-233. ISSN 0169-023X

[img]
Preview
PDF
1618Kb
Abstract:An important problem in the physical design of databases is the selection of secondary indices. In general, this problem cannot be solved in an optimal way due to the complexity of the selection process. Often use is made of heuristics such as the well-known ADD and DROP algorithms. In this paper it will be shown that frequently used cost functions can be classified as super- or submodular functions. For these functions several mathematical properties have been derived which reduce the complexity of the index selection problem. These properties will be used to develop a tool for physical database design and also give a mathematical foundation for the success of the before-mentioned ADD and DROP algorithms.
Item Type:Article
Copyright:© 1993 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/18207
Official URL:http://dx.doi.org/10.1016/0169-023X(93)90023-I
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 118727