An extremal problem on trees and database theoryReport as inadecuate

An extremal problem on trees and database theory - Download this document for free, or read online. Document in PDF available to download.

1 Alfréd Rényi Institute of Mathematics 2 TUB - Technische Universität Berlin Berlin

Abstract : We consider an extremal problem on labelled directed trees and applications to database theory. Among others, we will show explicit keysystems on an underlying set of size $n$, that cannot be represented by a database of less than $2^{n1-c\cdot \log \log n - \log n}$ rows.

Keywords : relational database minimum matrix representation extremal problems labelled directed tree

Author: Gyula O.H. Katona - Krisztián Tichler -



Related documents