Discovering Domain Orders via Order Dependencies
Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava, Jaroslaw Szlichta
Abstract
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 044eb8aa-356b-45f5-9050-6f5f94f8a8feRelated papers
- Efficient Bidirectional Order Dependency DiscoveryYifeng Jin, Lin Zhu, Zijing TanICDE 2020 · 15 citations
- Approximate Order Dependency DiscoveryYifeng Jin, Zijing Tan, Weijun Zeng, Shuai MaICDE 2021 · 7 citations
- Efficient Set-Based Order Dependency Discovery with a Level-Wise Hybrid StrategyYihan Li, Ruifeng Li, Zijing Tan, Weidong Yang et al.ICDE 2024 · 1 citation
- 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 et al.ICDE 2023 · 7 citations
