Conference item icon

Conference item

Factorised representations of query results: Size bounds and readability

Abstract:

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 defined by so-called factorisation trees. The first characterisation concerns sizes of factorised representations. For any query, we derive a size bound that is asymptotically tight within our class of f...

Expand abstract

Actions


Access Document


Publisher copy:
10.1145/2274576.2274607

Authors


Pages:
285-298
Host title:
ACM International Conference Proceeding Series
Publication date:
2012-01-01
DOI:
Source identifiers:
344924
ISBN:
9781450307918
Keywords:
Pubs id:
pubs:344924
UUID:
uuid:90fcc934-1ee0-40e5-9039-9ee4aee1e824
Local pid:
pubs:344924
Deposit date:
2013-11-17

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP