English

FDB: A Query Engine for Factorised Relational Databases

Databases 2012-03-14 v1 Data Structures and Algorithms

Abstract

Factorised databases are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. This paper introduces FDB, an in-memory query engine for select-project-join queries on factorised databases. Key components of FDB are novel algorithms for query optimisation and evaluation that exploit the succinctness brought by data factorisation. Experiments show that for data sets with many-to-many relationships FDB can outperform relational engines by orders of magnitude.

Keywords

Cite

@article{arxiv.1203.2672,
  title  = {FDB: A Query Engine for Factorised Relational Databases},
  author = {Nurzhan Bakibayev and Dan Olteanu and Jakub Závodný},
  journal= {arXiv preprint arXiv:1203.2672},
  year   = {2012}
}

Comments

12 pages, 9 figures

R2 v1 2026-06-21T20:33:00.820Z