Factorised representations of query results: Size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We give two characterisations of conjunctive queries based on factorisations of their results whose nesting structure is define...
Main Authors: | Olteanu, D, Závodný, J |
---|---|
Format: | Conference item |
Published: |
2012
|
Similar Items
-
Factorised Representations of Query Results: Size Bounds and Readability
by: Olteanu, D, et al.
Published: (2012) -
Demonstration of the FDB Query Engine for Factorised Databases
by: Bakibayev, N, et al.
Published: (2012) -
FDB: A Query Engine for Factorised Relational Databases
by: Bakibayev, N, et al.
Published: (2012) -
On Factorisation of Provenance Polynomials
by: Olteanu, D, et al.
Published: (2011) -
Factorisation in relational databases
by: Zavodny, J
Published: (2014)