Abstract
We study keys in higher-order datamodels. We show that they are equivalent with certain ideals. Based on that we introduce an ordering between key sets, and investigate systems of minimal keys. We give a sufficient condition for a Sperner-family of SHL-ideals being system of minimal keys, and give lower and upper bounds for the size of the smallest Armstrong-instance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From relations to Semistructured Data and XML. Morgan Kaufmann Publishers, San Francisco (2000)
Abiteboul, S., Hull, R.: Restructuring hierarchical database objects, Theoretical Computer Science (1988)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Armstrong, W.W.: Dependency structures of data base relationships. Information Processing, 580–583 (1974)
Brightwell, G., Katona, G.O.H.: A new type of coding theorem, Studia Sci. Math. Hungar. 38, 139–147 (2001)
Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybernetica (Szeged) 4, 247–252 (1979)
Demetrovics, J., Katona, G.O.H.: Extremal combinatorial problems in relational data base. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 110–119. Springer, Heidelberg (1981)
Demetrovics, J., Katona, G.O.H., Sali, A.: The characterization of branching dependencies. Discrete Applied Mathematics 40, 139–153 (1992)
Demetrovics, J., Katona, G.O.H., Sali, A.: Design type problems motivated by database theory. Journal of Statistical Planning and Inference 72, 149–164 (1998)
Ganter, B., Gronau, H.-D.O.F., Mullin, R.C.: On orthogonal double covers of K n . Ars Combinatoria 37, 209–221 (1994)
Hartmann, S., Link, S.: Reasoning about functional dependencies in an abstract data model. Electronic Notes in Theoretical Computer Science, vol. 84 (2003)
Hartmann, S., Link, S., Schewe, K.-D.: Capturing functional dependencies in the higher-order antity relationship model. Tech. Rep. 5/2003, Massey University, Department of Information Systems (2003)
Hartmann, S., Link, S., Schewe, K.-D.: Reasoning about functional and multivalued dependencies in the presence of base, record and finite list types (2003) (submitted)
Hartmann, S., Link, S., Schewe, K.-D.: Weak Functional Dependencies in Higher-Order Datamodels. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 116–133. Springer, Heidelberg (2004)
Paredaens, J., De Bra, P., Gyssens, M., Van Gucht, D.: The Structure of the Relational Database Model. Springer, Heidelberg (1989)
Schewe, K.-D., Thalheim, B.: Fundamental concepts of object oriented databases. Acta Cybernetica 11(4), 49–85 (1993)
Thalheim, B.: Foundations of entity-relationship modeling. Annals of Mathematics and Artificial Intelligence 6, 197–256 (1992)
Thalheim, B.: Entity-Relationship Modeling: Foundations of Database Technology. Springer, Heidelberg (2000)
Ullman, J.D.: Principles of Database Systems. Computer Science Press, Inc., Rockville (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sali, A. (2004). Minimal Keys in Higher-Order Datamodels. In: Seipel, D., Turull-Torres, J.M. (eds) Foundations of Information and Knowledge Systems. FoIKS 2004. Lecture Notes in Computer Science, vol 2942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24627-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24627-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20965-2
Online ISBN: 978-3-540-24627-5
eBook Packages: Springer Book Archive