Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$43,000.00

Probabilistic retrieval and cleaning of large uncertain and inconsistent databases

EF 2011-12

Résumé
Data generated by modern applications such as object tracking, sensor networks, and Web data integration involve uncertainty, and various anomalies such as missing values and duplication. While many research efforts have been focusing on data cleaning and dealing with inconsistent databases, very limited research has focused on enabling information retrieval queries and data exploration in probabilistic and uncertain databases. This proposal aims primarily at allowing users to effectively query and explore large volumes of inconsistent and uncertain data. I will focus in this proposal on two main research directions: first, allowing information retrieval style queries such as ranking, preference handling, and aggregation in the context of uncertain databases; and second, developing declarative data cleaning approaches based on probabilistic modeling of erroneous and inconsistent data. The proposed techniques will be tested in QualityDB, a probabilistic database engine prototype we are currently building, based on an open-source Database Management Systems. The goal is to build a generic framework that adapts to different probabilistic data models, and encapsulates efficient query processing algorithms to allow for pipelined execution guided by data quality and cleaning measures. Towards this goal, the proposed research plan has a set of short-term and long-term tasks. Short-term tasks include the following: (1) revising current query semantics to integrate ranking and aggregation queries along with probabilistic semantics; (2) extending the capabilities of current relational database engines to support storage and efficient retrieval of probabilistic data; and (3) developing declarative query language for specifying user-defined quality guarantees that guide the retrieval, processing and cleaning of dirty raw data. The long-term research tasks address integrating this framework into broader data management environments including Web search and document retrieval in XML and text databases.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
311671-2010
Name nom
Ilyas, Ihab
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2010
Award amount
43000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2711
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Database management
Research subject fr
Gestion de bases de données
Partie
2
Nb partie
5
Application title
Probabilistic retrieval and cleaning of large uncertain and inconsistent databases
Keyword
NSERC
Application summary
Data generated by modern applications such as object tracking, sensor networks, and Web data integration involve uncertainty, and various anomalies such as missing values and duplication. While many research efforts have been focusing on data cleaning and dealing with inconsistent databases, very limited research has focused on enabling information retrieval queries and data exploration in probabilistic and uncertain databases. This proposal aims primarily at allowing users to effectively query and explore large volumes of inconsistent and uncertain data. I will focus in this proposal on two main research directions: first, allowing information retrieval style queries such as ranking, preference handling, and aggregation in the context of uncertain databases; and second, developing declarative data cleaning approaches based on probabilistic modeling of erroneous and inconsistent data. The proposed techniques will be tested in QualityDB, a probabilistic database engine prototype we are currently building, based on an open-source Database Management Systems. The goal is to build a generic framework that adapts to different probabilistic data models, and encapsulates efficient query processing algorithms to allow for pipelined execution guided by data quality and cleaning measures. Towards this goal, the proposed research plan has a set of short-term and long-term tasks. Short-term tasks include the following: (1) revising current query semantics to integrate ranking and aggregation queries along with probabilistic semantics; (2) extending the capabilities of current relational database engines to support storage and efficient retrieval of probabilistic data; and (3) developing declarative query language for specifying user-defined quality guarantees that guide the retrieval, processing and cleaning of dirty raw data. The long-term research tasks address integrating this framework into broader data management environments including Web search and document retrieval in XML and text databases.