Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. BigDansing

BigDansing

Thumbnail Image
Download
Name

Madden_BigDansing.pdf

Size

946.89 KB

Format

Adobe PDF

Checksum (MD5)

7b6eb4108b23e2ff6ec85bc31cd48564

Author(s)
Khayyat, Zuhair
•
Ilyas, Ihab F.
•
Ouzzani, Mourad
•
Papotti, Paolo
•
Quiané-Ruiz, Jorge-Arnulfo
•
Tang, Nan
•
Yin, Si
•
Madden, Samuel R
•
Jindal, Alekh
Date Issued
May 2013
Journal
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15
Publisher
Association for Computing Machinery
Citation
Khayyat, Zuhair, et al. "BigDansing: A System for Big Data Cleansing. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD '15, 31 May - June 4, 2105, Melbourne, Australia, ACM Press, 2015, pp. 1215–30.
Version
Author's final manuscript
Abstract
Data cleansing approaches have usually focused on detecting and fixing errors with little attention to scaling to big datasets. This presents a serious impediment since data cleansing often involves costly computations such as enumerating pairs of tuples, handling inequality joins, and dealing with user-defined functions. In this paper, we present BigDansing, a Big Data Cleansing system to tackle efficiency, scalability, and ease-of-use issues in data cleansing. The system can run on top of most common general purpose data processing platforms, ranging from DBMSs to MapReduce-like frameworks. A user-friendly programming interface allows users to express data quality rules both declaratively and procedurally, with no requirement of being aware of the underlying distributed platform. BigDansing takes these rules into a series of transformations that enable distributed computations and several optimizations, such as shared scans and specialized joins operators. Experimental results on both synthetic and real datasets show that BigDansing outperforms existing baseline systems up to more than two orders of magnitude without sacrificing the quality provided by the repair algorithms.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/112981
DOI of Published Version
https://doi.org/10.1145/2723372.2747646
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.