Analyzing Deviations from Monotonic Trends through Database Repair
Shunit Agmon, Jonathan Gal, Amir Gilad, Ester Livshits, Or Mutay, Brit Youngmann, Benny Kimelfeld
Abstract
Datasets often exhibit violations of expected monotonic trends-for example, higher education level correlating with higher average salary, newer homes being more expensive, or diabetes prevalence increasing with age. We address the problem of quantifying how far a dataset deviates from such trends. To this end, we introduce Aggregate Order Dependencies (AODs), an aggregation-centric extension of the previously studied order dependencies. An AOD specifies that the aggregated value of a target attribute (e.g., mean salary) should monotonically increase or decrease with the grouping attribute (e.g., education level).
We formulate the AOD repair problem as finding the smallest set of tuples to delete from a table so that the given AOD is satisfied. We analyze the computational complexity of this problem and propose a general algorithmic template for solving it. We instantiate the template for common aggregation functions, introduce optimization techniques that substantially improve the runtime of the template instances, and develop efficient heuristic alternatives. Our experimental study, carried out on both real-world and synthetic datasets, demonstrates the practical efficiency of the algorithms and provides insight into the performance of the heuristics. We also present case studies that uncover and explain unexpected AOD violations using our framework.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on7
- On Detecting Cherry-picked TrendlinesAbolfazl Asudeh, H. V. Jagadish, You Wu, Cong YuVLDB 2020 · 32 citations
- Properties of Inconsistency Measures for DatabasesEster Livshits, Rina Kochirgan, Segev Tsur, Ihab F. Ilyas et al.SIGMOD 2021 · 21 citations
- On Multiple Semantics for Declarative Database RepairsAmir Gilad, Daniel Deutch, Sudeepa RoySIGMOD 2020 · 20 citations
- On Detecting Cherry-picked GeneralizationsYin Lin, Brit Youngmann, Yuval Moskovitch, H. V. Jagadish et al.VLDB 2022 · 18 citations
- Efficient Bidirectional Order Dependency DiscoveryYifeng Jin, Lin Zhu, Zijing TanICDE 2020 · 15 citations
Related papers
- Approximate Order Dependency DiscoveryYifeng Jin, Zijing Tan, Weijun Zeng, Shuai MaICDE 2021 · 7 citations
- Fast Incremental Discovery of Pointwise Order DependenciesZijing Tan, Ai Ran, Shuai Ma, Sheng QinVLDB 2020 · 22 citations
- TSDDISCOVER: Discovering Data Dependency for Time Series DataXiaoou Ding, Yingze Li, Hongzhi Wang, Chen Wang et al.ICDE 2024 · 11 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
- Anytime Algorithms for Approximate Functional DependenciesSanjivni Rana, Junya Ogawa, Suraj Shetiya, Senjuti Basu Roy et al.KDD 2025
