Efficient Processing of Top-K Preference Queries on Incomplete Information

Abstract

Incomplete data is general, finding and scrutinizing these kind of data is basic starting late. The top k overwhelming (TKD) queries return k challenges that supersedes most extraordinary number of things in a given dataset. It joins the advantages of skyline and top k queries. This accept a basic part in various decision bolster applications. Incomplete data holds in honest to goodness datasets, in light of contraption dissatisfaction, security protection, data setback. Here, framework finish an efficient examination of TKD queries on incomplete data, which joins the data having missing dimensional value(s). We handle this issue, and present an algorithm for taking note of TKD queries over incomplete data. Our systems use a couple of strategies, for instance, upper bound score pruning, bitmap pruning, and midway score pruning, to ascend the capability of queries. Created test e valuation using both authentic and designed datasets shows the feasibility of the made pruning rules and avows execution of algorithms.

Authors and Affiliations

Mr. Maharudra Banale, Prof. Bhagwan Kurhe

Keywords

Related Articles

Experimental Study on High Strength Concrete Using Industrial Wastes

Generally the river sand is used as a fine aggregate on concrete and is obtained by mining the sand from river bed. Increased sand mining not only affects the aquifer of the river bed but also causes environmental probl...

Detection of Foreground Object for Video Surveillance Applications

This paper describes the simplest and efficient method to find the foreground objects in less computation time. Initially the video is converted into frames. Those frames are compressed by eliminating the redundant fram...

An Energy Efficient Model For Green Computing

Cloud computing has emerged as a key component in the field of computer and internet. Cloud has a service model and deployment model, the service model incorporates SaaS, PaaS and IaaS whereas the deployment model inclu...

Evolutionary Technique for Network Routing

Applying mathematics to a problem of the real world mostly means, at first, modeling the problem mathematically, maybe with hard restrictions, idealizations, or simplifications, then solving the mathematical problem, an...

Traffic Analysis of a Twin City

Except in a few cases, buses operate in the general traffic system. Sometimes they have the benefit of bus lanes and other priorities to offset the effect of traffic congestion, but unless they are completely segregated...

Download PDF file
  • EP ID EP24424
  • DOI -
  • Views 260
  • Downloads 10

How To Cite

Mr. Maharudra Banale, Prof. Bhagwan Kurhe (2017). Efficient Processing of Top-K Preference Queries on Incomplete Information. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 5(6), -. https://europub.co.uk/articles/-A-24424