Deductive Optimization of Relational Data Storage

03/08/2019
by   John K. Feser, et al.
0

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 also build a compiler for this language, which is specialized for a dataset and a query workload. We 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.

READ FULL TEXT
research
08/15/2020

Automatic Storage Structure Selection for hybrid Workload

In the use of database systems, the design of the storage engine and dat...
research
07/25/2018

Compiling Database Application Programs

There is a trend towards increased specialization of data management sof...
research
09/20/2023

Vector database management systems: Fundamental concepts, use-cases, and current challenges

Vector database management systems have emerged as an important componen...
research
06/18/2017

Evolutionary Data Systems

Anyone in need of a data system today is confronted with numerous comple...
research
07/03/2019

An Experimental Evaluation of Large Scale GBDT Systems

Gradient boosting decision tree (GBDT) is a widely-used machine learning...
research
04/22/2020

Qd-tree: Learning Data Layouts for Big Data Analytics

Corporations today collect data at an unprecedented and accelerating sca...
research
09/04/2022

Towards Adaptive Storage Views in Virtual Memory

Traditionally, DBMSs separate their storage layer from their indexing la...

Please sign up or login with your details

Forgot password? Click here to reset