Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms

• Main Authors: Kuzin, Yakov, Shcheka, Dmitriy, Polyntsov, Michael, Stupakov, Kirill, Firsov, Mikhail, Chernishev, George
• Format: Conference Proceeding
• Language: English
• Subjects: C++ languages; Cleaning; data profiling; fastod; Focusing; Memory management; order; order dependency; Query processing; Technological innovation
• ISSN: 2305-7254; 2305-7254; 2343-0737
• DOI: 10.23919/FRUCT61870.2024.10516381

Science-intensive data profiling focuses on discovery and validation of various patterns in datasets. This study considers discovery of one such pattern - order dependency (OD). Simply put, OD states that some list of columns is ordered according to another one. It is of use for database query optimization, data cleaning and deduplication, anomaly detection, and much more. Existing discovery methods have approached this problem solely from the algorithmic standpoint, without focusing on the implementation side. At the same time, this problem is very computationally intensive, and therefore this part should not be ignored, as it brings ODs closer to industrial use. In this paper, we study two algorithms for OD discovery which target different OD axiomatizations - FASTOD and ORDER. We start by reimplementing these algorithms in C++ in order to speed them up and lower their memory consumption. We then analyze their bottlenecks and propose several techniques which improve their performance even further. To perform evaluation, we have implemented these algorithms inside Desbordante - a science-intensive, high-performance, and open-source data profiling tool developed in C++. Experiments have demonstrated a performance improvement of up to 3x obtained by reimplemented versions, and, with the application of our techniques, up to 10x. Memory consumption has been lowered by up to 2.9x.