License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2019.6
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10308/
Go to the corresponding LIPIcs Volume Portal


De Sa, Christopher ; Ilyas, Ihab F. ; Kimelfeld, Benny ; Ré, Christopher ; Rekatsinas, Theodoros

A Formal Framework for Probabilistic Unclean Databases

pdf-format:
LIPIcs-ICDT-2019-6.pdf (0.7 MB)


Abstract

Most theoretical frameworks that focus on data errors and inconsistencies follow logic-based reasoning. Yet, practical data cleaning tools need to incorporate statistical reasoning to be effective in real-world data cleaning tasks. Motivated by empirical successes, we propose a formal framework for unclean databases, where two types of statistical knowledge are incorporated: The first represents a belief of how intended (clean) data is generated, and the second represents a belief of how noise is introduced in the actual observed database. To capture this noisy channel model, we introduce the concept of a Probabilistic Unclean Database (PUD), a triple that consists of a probabilistic database that we call the intention, a probabilistic data transformator that we call the realization and captures how noise is introduced, and an observed unclean database that we call the observation. We define three computational problems in the PUD framework: cleaning (infer the most probable intended database, given a PUD), probabilistic query answering (compute the probability of an answer tuple over the unclean observed database), and learning (estimate the most likely intention and realization models of a PUD, given examples as training data). We illustrate the PUD framework on concrete representations of the intention and realization, show that they generalize traditional concepts of repairs such as cardinality and value repairs, draw connections to consistent query answering, and prove tractability results. We further show that parameters can be learned in some practical instantiations, and in fact, prove that under certain conditions we can learn a PUD directly from a single dirty database without any need for clean examples.

BibTeX - Entry

@InProceedings{desa_et_al:LIPIcs:2019:10308,
  author =	{Christopher De Sa and Ihab F. Ilyas and Benny Kimelfeld and Christopher R{\'e} and Theodoros Rekatsinas},
  title =	{{A Formal Framework for Probabilistic Unclean Databases}},
  booktitle =	{22nd International Conference on Database Theory (ICDT 2019)},
  pages =	{6:1--6:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-101-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{127},
  editor =	{Pablo Barcelo and Marco Calautti},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10308},
  doi =		{10.4230/LIPIcs.ICDT.2019.6},
  annote =	{Keywords: Unclean databases, data cleaning, probabilistic databases, noisy channel}
}

Keywords: Unclean databases, data cleaning, probabilistic databases, noisy channel
Seminar: 22nd International Conference on Database Theory (ICDT 2019)
Issue Date: 2019
Date of publication: 19.03.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI