Abstract
In this paper dense families of database relations are introduced. We characterize dependencies and keys of relation instances in terms of dense families. Key functions are also introduced. They are isotone Boolean functions, which minimal true vectors are the characteristic vectors of the keys. We show that each dense family determines an isotone Boolean function which is the dual of the key function. We also show how to determine for a given relation r an r-dense family which size is at most m 2/2−m/2+1, where m is the number of tuples in r.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. W. Armstrong, Dependency structure of data base relationships, in: Information Processing 74 (North-Holland, Amsterdam, 1974) 580–583.
J. C. Bioch, T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 50–63.
C. Berge, Hypergraphs. Combinatorics of Finite Sets (North-Holland, Amsterdam, 1989).
J. Demetrovics, G. O. H. Katona, D. Miklos, O. Seleznjev, B. Thalheim, Asymptotic properties of keys and functional dependencies in random databases, Theoretical Computer Science 190 (1998) 151–166.
R. Elmasri, S. B. Navathe, Fundamentals of Database Systems, 3rd ed. (Addison-Wesley, Reading, Massachusetts, 2000).
M. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms 21 (1996) 618–628.
J. Järvinen, Preimage relations and their matrices, in: L. Polkowski, A. Skowron, eds., Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence 1424 (Springer, Berlin, 1998) 139–146.
W. Lipski, Jr., Two NP-complete problems related to information retrieval, in: M. Karpiński, ed., Proceedings of the 1977 International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science 56 (Springer, Berlin, 1977) 452–458.
A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, in: R. Słowinski, ed., Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, (Kluwer, Dordrecht, 1991) 331–362.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Järvinen, J. (2001). Dense Families and Key Functions of Database Relation Instances. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive