New Approaches of Ranking Queries in Uncertain Databases

Abstract

New applications such as sensor data monitoring and mobile device tracking, rise up the issue of uncertain data management. Compared to “certain” data, the data in the uncertain database are not exact points, which, instead, often reside within a region. Here the study ranked queries over the uncertain data. The existing system such as decision making, recommendation raising, and data mining tasks proposes only for certain data. We define several fundamental properties including performance, radius range, unique-range, value-invariance and stability. Robust novel solutions speed up the probabilistic ranked query (PRank) with monotonic preference functions over the uncertain database. Specifically, Introduced two effective pruning methods: Spatial and Probabilistic pruning, these reduce the PRank search space. A special case of PRank with linear preference function is also studied and seamlessly integrate these pruning heuristics into the PRank query procedure. A preference function specified by users, a ranked query retrieves k data objects in the database such that their scores (calculated by the given preference function) are the highest. The proposed system tackles the PRank query processing over the join of two distinct uncertain databases. Extensive experiments will be conducted to demonstrate the efficiency and effectiveness in answering PRank queries. Our approach could effectively optimize the time and cost involved when compared to the existing systems.

Authors and Affiliations

R. Kanagavalli, S. Ramachandran, A. Poobalan

Keywords

Related Articles

Indoor positioning and Navigation using Light sensor

Indoor positioning systems now a days got an extensive popularity. These systems have been successfully used in many applications such as asset tracking and inventory management. In this work we describes a novel lig...

A Dispersed Mobile Q&A Coordination Rooted In Set of Connections

Social internet searchers like Google, Bing answer truthful inquiries yet the late research endeavours have been centred around the social based question and answer (Q&A) framework which determines non-accurate quest...

A Novel Virtual Grounding Based Read-Error Reduction Technique in SRAM

In this paper we are going to modify the Schmitt Trigger based SRAM for the purpose of more reduced power & area than the existing type of designs as well as the new design which is combined of virtual grounding with...

Design of a CPW –Fed L slit antenna for X band application

A coplanar waveguide (CPW) fed antenna with L-slit is presented in this paper. Two L-slits are introduced both sides of the patch to reduce the resonant frequency.The antenna has been designed on a FR4 substrate with...

Design of Low Power FPGA using Autonomous Power Gating and LEDR Encoding

The most important key challenge in the IC scaling era is to deliver high performance solutions in the process of minimizing power, area and cost. The main objective of this paper is to reduce power consumption by co...

Download PDF file
  • EP ID EP27431
  • DOI -
  • Views 449
  • Downloads 8

How To Cite

R. Kanagavalli, S. Ramachandran, A. Poobalan (2012). New Approaches of Ranking Queries in Uncertain Databases. International Journal of Research in Computer and Communication Technology, 1(1), -. https://europub.co.uk/articles/-A-27431