Authors: Roman Statnikov, Alex Bordetsky, Josef Matusov, Alexander Statnikov
Addresses: Department of Information Sciences, Naval Postgraduate School, 589 Dyer Rd., Root Hall, 203E, Monterey, CA, USA; Mechanical Engineering Research Institute, Russian Academy of Sciences, M. Kharitonievsky per., 4, Moscow, 101830, Russia. ' Department of Information Sciences, Naval Postgraduate School, 589 Dyer Rd., Root Hall, 225, Monterey, CA, USA. ' Mechanical Engineering Research Institute, Russian Academy of Sciences, M. Kharitonievsky per., 4, Moscow, 101830, Russia. ' Center for Health Informatics and Bioinformatics, New York University Langone Medical Center, 333 E38th Street, 6th Floor, New York, NY 10016, USA
Abstract: The advent of the World Wide Web made search engines the most essential component of our everyday life. However, the analysis of information provided by current search engines often presents a significant challenge to the client. This is to a large extent because the client has to deal with many alternatives (solutions) described by contradictory criteria, when selecting the most preferable (optimal) solutions. Furthermore, criteria constraints cannot be defined a priori and have to be defined interactively in the process of a dialog of the client with computer. In such situations, construction of the feasible solution set has a fundamental value. In this paper, we propose a new methodology for systematically constructing the feasible solution set for database search. This allows to significantly improving the quality of search results.
Keywords: database search; www search engines; contradictory criteria; criteria constraints; feasible solution set; Pareto optimal set; parameter space investigation method; PSI method; analysis tables; world wide web; internet search.
International Journal of Services Sciences, 2011 Vol.4 No.1, pp.1 - 13
Available online: 07 Feb 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article