On the Selection of an Optimal Set of Indexes

DOI10.1109/TSE.1983.236458MaRDI QIDQ3965585zbMATH OpenOpenAlexFDO

Authors Maggie Y. L. Ip, Lawrence V. Saxton, Vijay Raghavan

Publication date 1983

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1983.236458

zbMATH Keywords

complexityapproximation algorithmknapsack problemattribute selectiondatabase designindex selectionsecondary indexlarge database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cited in

(4)

• Page-queries as a tool for organizing secondary memory auxiliary databases. I: Algorithmic aspects and architectural framework of query processing
• Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents
• Separating lifted odd-hole inequalities to solve the index selection problem
• Near optimal multiple choice index selection for relational databases

This page was built for publication: On the Selection of an Optimal Set of Indexes

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