An extremal problem on trees and database theory

Gyula O.H. Katona 1 Krisztián Tichler 2
1 Alfréd Rényi Institute of Mathematics
2 TUB - Technische Universität 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^{n(1-c\cdot \log \log n / \log n)}$ rows.
Keywords : relational database minimum matrix representation extremal problems labelled directed tree
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.293-298, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01184450
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 14:59:33
Dernière modification le : samedi 16 décembre 2017 - 07:18:04
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 11:14:26

Fichier

dmAE0158.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184450, version 1

Collections

INSMI | TDS-MACS

Citation

Gyula O.H. Katona, Krisztián Tichler. An extremal problem on trees and database theory. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.293-298, 2005, DMTCS Proceedings. 〈hal-01184450〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

339

Téléchargements de fichiers

88

Contact


archive-ouverte@inria.fr