Discovering Domain Orders via Order Dependencies
Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava, Jaroslaw Szlichta
摘要
Most real-world data come with explicitly defined domain orders; e.g., lexicographic for strings, numeric for integers, and chronological for time. Our goal is to discover implicit domain orders that we do not already know; for instance, that the order of months in the Chinese Lunar calendar is CornerApricotPeach. To do so, we enhance data profiling methods by discovering implicit domain orders in data through order dependencies. We enumerate tractable special cases and show that the general case is NP-complete but can be effectively handled by a SAT solver. We also devise an interestingness measure to rank the discovered implicit domain orders. Based on an extensive suite of experiments with real-world data, we establish the efficacy of our algorithms.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Efficient Bidirectional Order Dependency DiscoveryYifeng Jin, Lin Zhu, Zijing TanICDE 2020 · 被引用 15 次
- Approximate Order Dependency DiscoveryYifeng Jin, Zijing Tan, Weijun Zeng, Shuai MaICDE 2021 · 被引用 7 次
- Efficient Set-Based Order Dependency Discovery with a Level-Wise Hybrid StrategyYihan Li, Ruifeng Li, Zijing Tan, Weidong Yang 等ICDE 2024 · 被引用 1 次
- Ordered Objectives in Maximum SatisfiabilityJeremias Berg, André Schidler, Matti JärvisaloAAAI 2026
- IndiBits: Incremental Discovery of Relaxed Functional Dependencies using Bitwise SimilarityBernardo Breve, Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia 等ICDE 2023 · 被引用 7 次
