An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Daniel J. Dougherty

TL;DR
This paper presents enhancements to an algorithm that converts relational algebra specifications into efficient, robust database transactions, improving the Alchemy tool's performance and reliability.
Contribution
It introduces an improved algorithm for translating relational algebra formulas into database transaction code, advancing the automation and robustness of Alloy-based specifications.
Findings
Enhanced algorithm increases transformation efficiency
Improved robustness of transaction generation
Better integration with persistent databases
Abstract
Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.
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
TopicsDistributed systems and fault tolerance · Advanced Database Systems and Queries · Service-Oriented Architecture and Web Services
