Recent combinatorial results in the theory of relational databases

Authors:
J. Demetrovics;Gy. O. H. Katona;D. Miklós
Affiliations:
Computer and Automation Institute Hungarian Academy of Sciences Kende u. 13-17, H-1111 Budapest, Hungary;Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Reáltanoda utca 13-15, H-1053 Budapest, Hungary;Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Reáltanoda utca 13-15, H-1053 Budapest, Hungary
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2003

Citing 8
Cited 0

On minimum matrix representation of closure operations

Discrete Applied Mathematics
Asymptotic properties of keys and functional dependencies in random databases

Theoretical Computer Science - Special issue: database theory
Combinatorial and Algebraic Results for Database Relations

ICDT '92 Proceedings of the 4th International Conference on Database Theory
The Average Length of Keys and Functional Dependencies in (Random) Databases

ICDT '95 Proceedings of the 5th International Conference on Database Theory
Error-Correcting Keys in Relational Databases

FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Minimum Matrix Representation of Some Key System

FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Extremal Combinatorial Problems in Relational Data Base

FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Minimum matrix representation of closure operations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.98

Visualization

Abstract

Recent results of the authors-some of which are joint with Thalheim and Seleznjev- in the area of combinatorial investigations of the relational database model are presented here. In relational databases keys-combinations of attributes uniquely identifying the records-play an important role. The structure and size of keys have been widely investigated. Here, after a short review of the earlier results, we discuss two generalizations: the (average) structure and size of keys in a random database and the concept of error-correcting keys in case of unreliable data collection.