International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 5 | Number 1 | Year 2013 | Article Id. IJCTT-V5N1P104 | DOI : https://doi.org/10.14445/22312803/IJCTT-V5N1P104

User- And Query-Conditional Ranking for Web Databases

Mrs.D.Kalyani , Mrs. M.Suganya

Citation :

Mrs.D.Kalyani , Mrs. M.Suganya, "User- And Query-Conditional Ranking for Web Databases," International Journal of Computer Trends and Technology (IJCTT), vol. 5, no. 1, pp. 16-19, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V5N1P104

Abstract

The emergence of the in-depth 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.

Keywords

ranking query, web database, deep web

References

[1]  M. K. Bergman. The deep web: Surfacing hidden value. Journal of Electronic Publishing, 7(1), 2001.
[2]. K. C.-C. Chang, B. He, C. Li, M. Patil, and Z. Zhang. Structured databases on the web: Observations and implications. SIGMOD Record, 33(3):61–70, 2004.
[3]  M.K. Bergman, “The Deep Web: Surfacing Hidden Value,” J. Electronic Publishing, vol. 7, no. 1, pp. 41-50, 2001.
[4] BREESE, J.,HECKERMAN, D., AND KADIE, C. 1998. Empirical analysis of predictive algorithms for collaborativefiltering. In proceedings of the 14th Conference on Uncertainty in Artificial Intelligence
[5] Z. Song and N. Roussopoulos.K-nearest neighbor search for moving query point. In SSTD, pages 79–96, 2001.