An extremal problem on trees and database theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

An extremal problem on trees and database theory

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^{n(1-c\cdot \log \log n / \log n)}$ rows.
Fichier principal
Vignette du fichier
dmAE0158.pdf (168.87 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184450 , version 1 (14-08-2015)

Identifiers

Cite

Gyula O.H. Katona, Krisztián Tichler. An extremal problem on trees and database theory. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.293-298, ⟨10.46298/dmtcs.3461⟩. ⟨hal-01184450⟩

Collections

INSMI TDS-MACS
52 View
538 Download

Altmetric

Share

Gmail Facebook X LinkedIn More