2012/03/12 by Nurzhan Bakibayev, Bakibayev, Nurzhan, Dan Olteanu +3
Computer Science · #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #FOS: Computer and information sciences #cs.DB #cs.DS
paper · pdf · doi:10.48550/arxiv.1203.2672
12 pages, 9 figures
arxiv created 2012/03/12 · arxiv updated 2012/03/14
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.