Discovering Functional Dependencies through Hitting Set Enumeration

Author:

Bleifuß Tobias1ORCID,Papenbrock Thorsten2ORCID,Bläsius Thomas3ORCID,Schirneck Martin4ORCID,Naumann Felix1ORCID

Affiliation:

1. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany

2. Philipps University of Marburg, Marburg, Germany

3. Karlsruhe Institute of Technology, Karlsruhe, Germany

4. University of Vienna, Vienna, Austria

Abstract

Functional dependencies (FDs) are among the most important integrity constraints in databases. They serve to normalize datasets and thus resolve redundancies, they contribute to query optimization, and they are frequently used to guide data cleaning efforts. Because the FDs of a particular dataset are usually unknown, automatic profiling algorithms are needed to discover them. These algorithms have made considerable advances in the past few years, but they still require a significant amount of time and memory to process datasets of practically relevant sizes. We present FDHits, a novel FD discovery algorithm that finds all valid, minimal FDs in a given relational dataset. FDHits is based on several discovery optimizations that include a hybrid validation approach, effective hitting set enumeration techniques, one-pass candidate validations, and parallelization. Our experiments show that FDHits, even without parallel execution, has a median speedup of 8.1 compared to state-of-the-art FD discovery algorithms while using significantly less memory. This allows the discovery of all FDs even on datasets that could not be processed by the current state-of-the-art.

Publisher

Association for Computing Machinery (ACM)

Reference43 articles.

1. Profiling relational data: a survey

2. DFD

3. Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the International Conference on Very Large Databases (VLDB). 487--499.

4. Claude Berge. 1989. Hypergraphs - Combinatorics of Finite Sets. North-Holland Mathematical Library, Vol. 45. North-Holland Publishing Company, Amsterdam, Netherlands.

5. Hitting set enumeration with partial information for unique column combination discovery

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3