An extremal problem on trees and database theory
Gyula O. H. Katona, Krisztián Tichler
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 2n(1-c·loglogn/logn) rows.
Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page