Computer-Orchestrated Design of Algorithms: From Join Specification to Implementation
Zeyuan Hu

TL;DR
This paper introduces CODA, a framework for testing and refining the logical-to-physical translation of join algorithms, exemplified by TreeTracker Join, improving correctness and guiding architectural evolution.
Contribution
It presents a novel, structure-aware testing framework that isolates subtle translation defects and refines the formal preconditions of join algorithms.
Findings
CODA successfully isolates subtle translation defects.
Early structural testing refines algorithm preconditions.
The framework enhances the robustness of join algorithm implementations.
Abstract
Equipping query processing systems with provable theoretical guarantees has been a central focus at the intersection of database theory and systems in recent years. However, the divergence between theoretical abstractions and system assumptions creates a gap between an algorithm's high-level logical specification and its low-level physical implementation. Ensuring the correctness of this logical-to-physical translation is crucial for realizing theoretical optimality as practical performance gains. Existing database testing frameworks struggle to address this need because necessary algorithm-specific inputs such as join trees are absent from standard test case generation, and integrating complex algorithms into these frameworks imposes prohibitive engineering overhead. Fallback solutions, such as using macro-benchmark queries, are inherently too noisy for isolating intricate defects…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Software Testing and Debugging Techniques · Graph Theory and Algorithms
