Pith. sign in

REVIEW 4 cited by

Desbordante: from benchmarking suite to high-performance science-intensive data profiler (preprint)

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.05965 v1 pith:MR4DJXRF submitted 2023-01-14 cs.DB cs.AIcs.LG

classification cs.DBcs.AIcs.LG
keywords datadesbordantediscoveryprimitiveprimitivesprofilingscience-intensivesystems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pioneering data profiling systems such as Metanome and OpenClean brought public attention to science-intensive data profiling. This type of profiling aims to extract complex patterns (primitives) such as functional dependencies, data constraints, association rules, and others. However, these tools are research prototypes rather than production-ready systems. The following work presents Desbordante - a high-performance science-intensive data profiler with open source code. Unlike similar systems, it is built with emphasis on industrial application in a multi-user environment. It is efficient, resilient to crashes, and scalable. Its efficiency is ensured by implementing discovery algorithms in C++, resilience is achieved by extensive use of containerization, and scalability is based on replication of containers. Desbordante aims to open industrial-grade primitive discovery to a broader public, focusing on domain experts who are not IT professionals. Aside from the discovery of various primitives, Desbordante offers primitive validation, which not only reports whether a given instance of primitive holds or not, but also points out what prevents it from holding via the use of special screens. Next, Desbordante supports pipelines - ready-to-use functionality implemented using the discovered primitives, for example, typo detection. We provide built-in pipelines, and the users can construct their own via provided Python bindings. Unlike other profilers, Desbordante works not only with tabular data, but with graph and transactional data as well. In this paper, we present Desbordante, the vision behind it and its use-cases. To provide a more in-depth perspective, we discuss its current state, architecture, and design decisions it is built on. Additionally, we outline our future plans.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FastGFDs: Efficient Validation of Graph Functional Dependencies with Desbordante

    cs.DB 2026-08 conditional novelty 6.0 of 10

    FastGFDs, a sequential GFD validation algorithm using Core-First Decomposition and the Compact Path Index, runs up to 3x faster and uses 5x less memory than the parallel baseline on a low-end laptop.

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

    cs.DB 2026-07 accept novelty 5.5 of 10

    C++ reimplementations plus range-based partitions and Boost structures speed FASTOD/ORDER OD discovery up to 10× and cut memory up to 2.9× versus Java baselines.

  3. Lightning Fast Matching Dependency Discovery with Desbordante

    cs.DB 2026-07 accept novelty 5.0 of 10

    Optimized HyMD in Desbordante discovers matching dependencies >40× faster on average (up to 170×) via focused sampling, faster generalization checks, and denser LHS representation.

  4. Extending Desbordante with Probabilistic Functional Dependency Discovery Support

    cs.DB 2026-07 conditional novelty 4.5 of 10

    pFD discovery (PerValue and PerTuple) is implemented in Desbordante and shown to find different dependencies than AFDs, at higher runtime and usually lower memory.

Pith tools