Recent combinatorial results in the theory of relational databases

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 stru...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical and computer modelling 2003-10, Vol.38 (7-9), p.763-772
Main Authors: Demetrovics, J, Katona, G.O.H., Miklos, D
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0895-7177
DOI:10.1016/S0895-7177(03)00277-2