Demonstration of the FDB query engine for factorised databases

Authors:
Nurzhan Bakibayev;Dan Olteanu;Jakub Závodný
Affiliations:
University of Oxford, UK;University of Oxford, UK;University of Oxford, UK
Venue:
Proceedings of the VLDB Endowment
Year:
2012

Citing 5
Cited 0

Incomplete object—a data model for design and planning applications

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Probabilistic Databases

Probabilistic Databases
Factorised representations of query results: size bounds and readability

Proceedings of the 15th International Conference on Database Theory
Tackling the partner units configuration problem

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
FDB: a query engine for factorised relational databases

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

FDB is an in-memory query engine for factorised databases, which are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. We demonstrate FDB using real data sets from IMDB, DBLP, and the NELL repository of facts learned from Web pages. The users can inspect factorisations as well as plans used by FDB to compute factorised results of select-project-join queries on factorised databases.