期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2013
卷号：5
期号：1
出版社：Seventh Sense Research Group
摘要：The emergence of the indepth Web databases has given a new connotation to the concept of rankingquery results. Main aspect of this ranking framework is a workload of ranking functions, where each function act for an individual user’s preferences towards the results of a particular query. Database systems always help a Boolean query recovery modelie., result will be of True or False, where a selection query on a SQL database provides all tuples that fulfills the conditions of the query. This frequently brings confusion to the user, with results with so countless solutions when the query isnot very selective based on condition, then too many outcomes may be in the answer.Weexperiment the obstacle of ranking the solutions to a database query when many tuples arereturned. In particular, we grantproposed system to tackle the problem for conjunctive and extentqueries, by holding and providing principles of probabilistic models from information retrieval fordatabase data. Proposed system is domain free and force data and workload statisticsand correlations. We assess the quality of our dealing with a user experiment on a real time database.Also, we propose and experimentally assess algorithms to effectively collect the topranked results, which show the scope of our ranking system.
