Cleaning and querying large uncertain databases

Pao Yue-kong Library Electronic Theses Database

Cleaning and querying large uncertain databases

 

Author: Chen, Jinchuan
Title: Cleaning and querying large uncertain databases
Degree: Ph.D.
Year: 2009
Subject: Hong Kong Polytechnic University -- Dissertations.
Database management.
Data mining.
Uncertainty -- Mathematical models.
Department: Dept. of Computing
Pages: xv, 184 p. : ill. ; 30 cm.
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b2306173
URI: http://theses.lib.polyu.edu.hk/handle/200/5242
Abstract: The management of uncertain databases has recently attracted tremendous interest from both industry and academy communities. In particular, there is a need to handle uncertain data in many emerging applications, such as the wireless sensor network, biometric and biological databases, location-based services, and data stream applications. To obtain meaningful results over these uncertain data, probabilistic queries are proposed, which augment query results with confidence. Although probabilistic queries are useful, evaluating them is costly, in terms of both I/O and computation. Moreover, the calculation of answer probabilities involves expensive numerical integrations. Therefore the efficient evaluation of probabilistic queries is a challenge for uncertain database management. In this thesis, we report our works for speeding up the evaluation performance of three kinds of important probabilistic queries - nearest-neighbor queries, fc-nearest-neighbor queries, and imprecise location-dependent queries. New approaches are proposed to improve the efficiency in both I/O and computation, and they are evaluated by extensive simulations over real and synthetic data sets. Another important issue that we consider in this thesis is the cleaning of uncertain data with the goal of achieving higher quality. Since the applications handling imprecise data have resource limitation, the cleaning process must optimize the use of resources. We study theoretically and experimentally on how the result quality could be maximized with constrained resources, with the use of entropy-based metrics. We also outline the future directions of our work.

Files in this item

Files Size Format
b2306173x.pdf 11.24Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information