Abstract
Consider a relation schema with a set of dependency constraints. A fundamental question is what is the minimum space where the possible instances of the schema can be ”stored”. We study the following model. Encode the instances by giving a function which maps the set of possible instances into the set of words of a given length over the binary alphabet in a decodable way. The problem is to find the minimum length needed. This minimum is called the information content of the database.
We investigate several cases where the set of dependency constraints consist of relatively simple sets of functional or multivalued dependencies.
We also consider the following natural extension. Is it possible to encode the instances such a way that small changes in the instance cause a small change in the code.
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1994)
Arenas, M., Libkin, L.: An information-theoretic approach to normal forms for relational and XML data. Journal of the ACM 52, 246–283 (2005)
Benczúr, A.: Information Measurement in Relational Data Bases. In: Biskup, J., Demetrovics, J., Paredaens, J., Thalheim, B. (eds.) MFDBS 1987. LNCS, vol. 305, pp. 1–9. Springer, Heidelberg (1988)
Benczúr, A.: The Evolution of Human Communication and the Information Revolution- A Mathematical Perspective. Mathematical and Computer Modelling 38(7-9), 691–708 (2003)
Bonferroni, C.E.: Teoria statistica delle classi e calcolo delle probabilità. Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze 8, 3–62 (1936)
Gilbert, E.N.: Random graphs. Annals of Mathematical Statistics 30(4), 1141–1144 (1959)
Grumbach, S., Mecca, G.: In Search of the Lost Schema. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 314–331. Springer, Heidelberg (1998)
Grumbach, S., Vianu, V.: Tractable query languages for complex object databases. Journal of Computer and System Sciences 51(2), 149–167 (1995)
Kolahi, S., Libkin, L.: On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. In: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006, Chicago, IL, USA, pp. 114–123 (2006)
Kolahi, S., Libkin, L.: Dependency-preserving normalization of relational and XML data. Journal of Computer and System Sciences 73(4), 636–647 (2007)
Kolahi, S., Libkin, L.: An information-theoretic analysis of worst-case redundancy in database design. ACM Transactions on Database Systems 35(1), 1–32 (2010)
Köhler, H.: Global Database Design based on Storage Space and Update Time Minimization. Journal of Universal Computer Science 15(1), 195–240 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katona, G.O.H., Tichler, K. (2012). Encoding Databases Satisfying a Given Set of Dependencies. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-28472-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28471-7
Online ISBN: 978-3-642-28472-4
eBook Packages: Computer ScienceComputer Science (R0)