Efficient discovery of approximate dependencies

Author:

Kruse Sebastian1,Naumann Felix1

Affiliation:

1. Hasso Plattner Institute, Potsdam, Germany

Abstract

Functional dependencies (FDs) and unique column combinations (UCCs) form a valuable ingredient for many data management tasks, such as data cleaning, schema recovery, and query optimization. Because these dependencies are unknown in most scenarios, their automatic discovery has been well researched. However, existing methods mostly discover only exact dependencies, i.e., those without violations. Real-world dependencies, in contrast, are frequently approximate due to data exceptions, ambiguities, or data errors. This relaxation to approximate dependencies renders their discovery an even harder task than the already challenging exact dependency discovery. To this end, we propose the novel and highly efficient algorithm P yro to discover both approximate FDs and approximate UCCs. P yro combines a separate-and-conquer search strategy with sampling-based guidance that quickly detects dependency candidates and verifies them. In our broad experimental evaluation, P yro outperforms existing discovery algorithms by a factor of up to 33, scales to larger datasets, and at the same time requires the least main memory.

Publisher

VLDB Endowment

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Cited by 60 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Applications of Information Inequalities to Database Theory Problems;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Towards the efficient discovery of meaningful functional dependencies;Information Systems;2023-06

3. Discovering Top-k Rules using Subjective and Objective Criteria;Proceedings of the ACM on Management of Data;2023-05-26

4. Pando: Enhanced Data Skipping with Logical Data Partitioning;Proceedings of the VLDB Endowment;2023-05

5. EulerFD: An Efficient Double-Cycle Approximation of Functional Dependencies;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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