For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
An Automatic Selection Method of Key Search Algorithms
Masami SHISHIBORI Junichi AOE Ki-Hong PARK Hisatoshi MOCHIZUKI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/04/25
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Software Systems
automatic selection of algorithms, priority cost, constraint relation, expert system, key search algorithm, program synthesis,
Full Text: PDF(895.7KB)>>
The selection of an appropriate key search algorithm for a specific application field is an important issue in application systems development. This is because data retrieval is the most time-consuming part of many application programs. An automatic selection method for key search algorithms is presented in this paper. The methodology has been implemented in a system called KESE2 (KEy-SEarch ALgorithm SElection). Key search algorithms are selected according to the user's requirements through interaction with KESE2 which bases its inferences on an evaluation table. This evaluation table contains values rating the performance of each key search algorithm for the different searching properties, or characteristics. The selection algorithm presented is based on step by step reduction of unsuitable key search algorithms and searching properties. The paper also proposes assistance facilities that consist of both a support function and a program synthesis function. Experimental results show that the appropriate key search algorithms are effectively selected, and that the necessary number of questions asked, to select the appropriate algorithm, is reduced to less than half of the total number of possible questions. The support function is useful for the user during the selection process and the program synthesis function fully translates a selected key search algorithm into high level language in an average of less than 1 hour.