Asymptotic properties of keys and functional dependencies in random databases

Theoretical Computer Science

Volumn 190, Issue 2, 1998, Pages 151-166

  Demetrovics, J ^a   Katona, G O H ^b   Miklos, D ^b   Seleznjev, O ^c   Thalheim, B ^d  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c MOSCOW STATE UNIVERSITY   (Russian Federation)

^d BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Bonferroni inequality; Functional dependency; Keys; Minimal keys; Poisson approximation; Random database

Indexed keywords

EID: 0242479587     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00089-3     Document Type: Article

References (15)

1. A. Albrecht, M. Altus, E. Buchholz, A. Düsterhöft, B. Thalheim, The rapid application and database development (RADD) workbench - A comfortable database design tool, J. Iivari, K. Lyytinen, M. Rossi (Eds.), in: Proc. CAiSE 95, Lecture Notes in Comput. Science, vol. 932, Springer, New York, 1995, 327-340.
2. A. Andreev, On asymptotic behavior of the number of nonredundant tests for almost all tables, Problemyi Kibemetiki 41 (1984) 117-142 (in Russian).
3. A.D. Barbour, L. Holst, S. Janson, Poisson Approximation, Clarendon Press, Oxford, 1992.
4. C. Beeri, M. Dowd, R. Fagin, R. Statman, On the structure of Armstrong relations for functional dependencies, J. ACM 31 (1984) 30-46.
5. A. Békéssy, J. Demetrovics, L. Hannák, P. Frankl, G. Katona, On the number of maximal dependencies in a database relation of fixed order, Discrete Math. 30 (1980) 83-88.
6. E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974) 485-515.
7. L. Devroye, A probabilistic analysis of the height of tries and of the complexity of trie sort, Acta Inform. 21 (1984) 229-237.
8. G. Gottlob, On the size of nonredundant FD-covers, Inform. Process. Lett. 24 (1987) 355-360.
9. H. Mannila, K.-J. Räihä, The Design of Relational Databases, Addison-Wesley, Amsterdam, 1992.
10. O. Seleznjev, B. Thalheim, On the number of minimal keys in relational databases over nonuniform domains, Acta Cybernet. 8 (1988) 267-271.
11. W. Szpankowski, On the height of digital trees and related problems, Algorithmica 6 (1991) 256-277.
12. B. Thalheim, On the number of keys in relational databases, in: Proc. FCT-87-Conf., Kazan, Lecture Notes in Comput. Science, vol. 278, Springer, New York, 1987, 448-455.
13. B. Thalheim, On semantic issues connected with keys in relational databases permitting null values, J. Inform. Process. Cybernet. EIK 25 (1989) 11-20.
14. B. Thalheim, Dependencies in Relational Databases, Teubner Verlag, Leipzig, 1989.
15. J.F. Traub, G.W. Wasilkowski, H. Woźniakowski, Information-based Complexity, Academic Press, San Diego, 1988.