Deductive Optimization of Relational Data Storage
Programming Languages
2020-02-07 v3 Databases
Abstract
Optimizing the physical data storage and retrieval of data are two key database management problems. In this paper, we propose a language that can express a wide range of physical database layouts, going well beyond the row- and column-based methods that are widely used in database management systems. We use deductive synthesis to turn a high-level relational representation of a database query into a highly optimized low-level implementation which operates on a specialized layout of the dataset. We build a compiler for this language and conduct experiments using a popular database benchmark, which shows that the performance of these specialized queries is competitive with a state-of-the-art in memory compiled database system.
Cite
@article{arxiv.1903.03229,
title = {Deductive Optimization of Relational Data Storage},
author = {John K. Feser and Samuel Madden and Nan Tang and Armando Solar-Lezama},
journal= {arXiv preprint arXiv:1903.03229},
year = {2020}
}