DBS-PSI: a new paradigm of database search Online publication date: Sat, 21-Feb-2015
by Roman Statnikov, Alex Bordetsky, Josef Matusov, Alexander Statnikov
International Journal of Services Sciences (IJSSCI), Vol. 4, No. 1, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Sciences (IJSSCI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com