Integrity constraints of probabilistic Databases

The Hong Kong University of Science and Technology
Department of Computer Science and Engineering

Title: "Integrity constraints of probabilistic Databases"

by

Mr. SHAO, Yufeng

Abstract

Probabilistic database has received growing attention recent years. With
ever increasing amount of data in the latest decades, we are faced with the
problem of how to handle this unprecedented large amount of data as well as
increasing noise and errors in collected data. Although various products
have been designed to cope with this challenge, a lot of problems and
obstacles still exist. Probabilistic database provides another way to handle
and store large amount data. A lot of researches have been conducted to
improve the performance of probabilistic database system. However, this kind
of system is still not robust and well developed compared to the traditional
relational database model and more works need to be done in order to further
improve it. In probabilistic database, there is always a problem of how to
perform the integrity checks and resolve any inconsistency if they occur.
In this work, we will address the problem of resolving inconsistency in
probabilistic database system with the help of functional dependencies and
inclusion dependencies. We extended the original Lp-chase algorithm and
improve its performance under a new schematic. Furthermore, we provided a
new method to maintain the inclusion dependency in probabilistic database
and update the whole database with a set of inclusion dependencies as well
as functional dependencies.

Date            :       16 May 2011 (Monday)

Time            :       3:00pm to 3:40pm

Venue		:       3402 (17-18 lift)

Advisor         :	Dr. Wilfred Ng

2nd reader      :	Prof. Dik Lee