Skip to main content

Compressed Databases


Suitable for

MSc in Computer Science


The goal of this project is to investigate theoretical and practical aspects of databases that use compressed representations of records in both query input and output. Under compression, we mean here techniques that resemble algebraic factorisation of Boolean functions. This is a novel research topic with no publications available so far in the context of database research. In the broad context of factorisations of Boolean functions, a good start is a paper by Brayton on "Factoring logic functions".

For more information, please contact Dan Olteanu.