Recent combinatorial results in the theory of relational databases

TitleRecent combinatorial results in the theory of relational databases
Publication TypeConference Paper
AuthorsDemetrovics, J., G. O. H. Katona, and D. Miklos
Year2003
Pages763 - 772
Conference NameMathematical and Computer Modelling
Languageeng
ISBN Number0895-7177
Notes

Recent combinatorial results in the theory of relational databases;

Publisher linkhttp://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V0V-4B82PCH-W-1&_cdi=5656&_user=7105836&_orig=browse&_coverDate=10%2F31%2F2003&_sk=999619992&view=c&wchp=dGLbVzb-zSkWA&md5=067b7f0de3fe9a02cb9167ed4177d5a8&ie=/sdarticle.pdf
Abstract

Recent results of the authors-some of which are joint with Thalheim and Seleznjevin 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. (C) 2003 Elsevier Ltd. All rights reserved.