Information measurement in relational databases
Proceedings on Mathematical Fundamentals of Database Systems on MFDBS 87
Tractable query languages for complex object databases
Journal of Computer and System Sciences
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
ICDT '99 Proceedings of the 7th International Conference on Database Theory
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dependency-preserving normalization of relational and XML data
Journal of Computer and System Sciences
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
The evolution of human communication and the information revolution - A mathematical perspective
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
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.