Prof. Dr. Felix Naumann


Paper on the Discovery of Order Dependencies Accepted at VLDB Journal

We are excited to announce that the article Efficient Distributed Discovery of Bidirectional Order Dependencies by Sebastian Schmidl and Thorsten Papenbrock was accepted for publication in the VLDB Journal.
More information about the algorithm and datasets can be found on the project's repeatability page. The code is available on GitHub.


Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table. They can express that, for example, sorting books by publication date in ascending order also sorts them by age in descending order. The knowledge about order relationships is useful for many data management tasks, such as query optimization, data cleaning, or consistency checking. Because the bODs of a specific dataset are usually not explicitly given, they need to be discovered. The discovery of all minimal bODs (in set-based canonical form) is a task with exponential complexity in the number of attributes, though, which is why existing bOD discovery algorithms cannot process datasets of practically relevant size in a reasonable time. In this paper, we propose the distributed bOD discovery algorithm DISTOD, whose execution time scales with the available hardware. DISTOD is a scalable, robust, and elastic bOD discovery approach that combines efficient pruning techniques for bOD candidates in set-based canonical form with a novel, reactive, and distributed search strategy. Our evaluation on various datasets shows that DISTOD outperforms both single-threaded and distributed state-of-the-art bOD discovery algorithms by up to orders of magnitude; it can, in particular, process much larger datasets.

  • Efficient Distributed Discovery of Bidirectional Order Dependencies. Schmidl, Sebastian; Papenbrock, Thorsten in The VLDB Journal (2021).