Efficient Refining Of Why-Not Questions on Top-K Queries
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2015, Vol 17, Issue 3
Abstract
Abstract: After decades of effort working on database performance, the quality and the usability of databasesystems have received more attention in recent years. In particular, answering the why-not questions after asearch is made has become more important. In this project, the problem of answering why-not questions on topkqueries and refining the user query is solved. Generally many users love to pose those kinds of queries whenthey are making multi-criteria decisions. However, they would also want to know why their expected answersdo not show up in the query results. The different algorithms are developed to answer such why-not questionsefficiently. Top-K dominating questions are those which have more than one or two results. When this caseoccurs, the result is ordered according to highest ranking among the records. A search is made and result isdisplayed, if the expected tuple does not appear then user raises a why-not query. This query is refined usingalgorithm and then the result is calculated. A penalty function is added such that the result can be returnedefficiently and without any fault.
Authors and Affiliations
P. Haripriya , J. Jegan Amarnath
Optical Character Recognition using Dynamic Memory Image Algorithm
Abstract : Embedded products have different types of display screens like LCD, Touch screen, CRT etc. For automating the development testing of such devices, we need to recognize the text displayed on it using a ca...
Low Energy Adaptive Clustering Hierarchy based routing Protocols Comparison for Wireless Sensor Networks
Abstract: As A Result Of Recent Advances In Microelectronic System Fabrication, Progress In Ad-Hoc Networking Routing Protocols, Integrated Circuit Technologies, Wireless Communications, Microprocessor Hardware And...
Overview: Importance of Network Security and Future Issues
Abstract: Network security has become more important to personal computer users, organizations, and the military. With the advent of the internet, security became a major concern and the history of security allows a bett...
Research on Strongly Unforgeable Ring Signature Scheme Based on ID
Abstract : A ring signature system is strongly unforgeable if the ring signature is existential unforgeable and, given ring signatures on some message m, the adversary can not produce a new ring signature on m. Str...
Energy Conservation in Wireless Sensor Networks: A Review
A wireless sensor network consists of a large number of sensor nodes which are deployed over an area to perform local computations based on information gathered from the surroundings. Each node in the netw...