Discovering Band Order Dependencies
Open Access
- 1 April 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1878-1881
Abstract
We introduce band ODs to model the semantics of attributes that are monotonically related with small variations without there being an intrinsic violation of semantics. To make band ODs relevant to real-world applications, we make them less strict to hold approximately with some exceptions. Since formulating integrity constraints manually is cumbersome, we study the problem of automatic approximate band OD discovery. We devise an algorithm that determines the optimal solution in polynomial time. We perform a thorough experimental evaluation of our techniques over real-world and synthetic datasets.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Effective and complete discovery of bidirectional order dependencies via set-based axiomsThe VLDB Journal, 2018
- Effective and complete discovery of order dependencies via set-based axiomatizationProceedings of the VLDB Endowment, 2017
- A Hybrid Approach to Functional Dependency Discovery2016
- Efficient order dependency detectionThe VLDB Journal, 2015
- Expressiveness and complexity of order dependenciesProceedings of the VLDB Endowment, 2013
- Discovering denial constraintsProceedings of the VLDB Endowment, 2013
- Fundamentals of order dependenciesProceedings of the VLDB Endowment, 2012
- Sequential dependenciesProceedings of the VLDB Endowment, 2009
- Tane: An Efficient Algorithm for Discovering Functional and Approximate DependenciesThe Computer Journal, 1999
- Order dependency in the relational modelTheoretical Computer Science, 1983