R. Statnikov, A. Bordetsky, J. Matusov, A. Statnikov
{"title":"DBS-PSI:数据库搜索的新范例","authors":"R. Statnikov, A. Bordetsky, J. Matusov, A. Statnikov","doi":"10.1504/IJSSCI.2011.038457","DOIUrl":null,"url":null,"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.","PeriodicalId":365774,"journal":{"name":"International Journal of Services Sciences","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"DBS-PSI: a new paradigm of database search\",\"authors\":\"R. Statnikov, A. Bordetsky, J. Matusov, A. Statnikov\",\"doi\":\"10.1504/IJSSCI.2011.038457\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":365774,\"journal\":{\"name\":\"International Journal of Services Sciences\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Services Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJSSCI.2011.038457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Services Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSCI.2011.038457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.