Skip Navigation

The Computer Journal 1985 28(4):406-408; doi:10.1093/comjnl/28.4.406
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hatzopoulos, M.
Right arrow Articles by Kollias, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the Selection of a Reduced Set of Indexes

M. Hatzopoulos1 * and J. (Yiannis) Kollias2 §

1 Department of Mathematical and Computer Sciences, Michigan Technological University, Houghton, USA, 2 Department of Computer Sciences, National Technical University of Athens, 9 Heroon Polytechnion Ave., Zografou, Athens, Greece

The secondary index selection problem (ISP) is known to be an NP-complete problem. The best possible known algorithm to find an exact solution of the ISP is the one developed by Schkolnick which utilizes the fact that the objective function of the problem satisfies the regularity condition. In a recent paper Ip et al presented a heuristic algorithm which solves the ISP with the added constraint that the creation and storage cost of the optimal selection must not exceed a certain specified cost. The current study observes that in practice this last problem can be translated to the classical ISP but requiring now that no more than k indexes may appear in the optimal set. It is shown that this new problem satisfies the regularity property. The study also presents the modifications needed to Schkolnick's algorithm for solving the problem considered.


* Department of Mathematical and Computer Sciences, Michigan Technological University, Houghton, MI 49931, USA

§ Department of Computer Sciences, National Technical University of Athens, 9 Heroon Polytechnion Ave., Zografou, Athens(621), Greece


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.