An information-lossless decomposition theory of relational information systems

Relational information systems, systems that can be represented by tables of finite states, are commonly used in many areas such as logic circuits, finite-state machines, and relational databases. Decomposition is a natural method of handling complex systems and removing redundancies. It splits a table into a network of smaller, simpler, and interrelated new tables. In order to preserve the original features of the system, any valid decomposition must be lossless. Commutative partitions play an important role in the decomposition. The commutative property is essentially a general algebraic formulation of independency of two partitions. We express the interdependency of two commutative partitions by a bipartite graph, and classify the hierarchical independency structures by the topological property of bipartite graphs. In particular, we show that two partitions are decomposable, the strongest version of dependency, if and only if the associate bipartite graph is uniform. We also adopt Shannon's entropy to quantify the amount of information contained in each partition, and formulate the information-lossless decomposition by the entropy conservation identity. Under the assumption of running intersection property, we show that the general formulation of information-lossless decomposition of relational systems is given by the entropy inclusion-exclusion equality. Applications of these formulations to Boolean logic circuits and relational databases are presented to manifest the information-lossless decomposition processes.

[1]  Daniele Frigioni,et al.  A general strategy for decomposing topological invariants of spatial databases and an application , 2002, Data Knowl. Eng..

[2]  Bernd Steinbach,et al.  Decomposition of multi-valued functions into min- and max-gates , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

[3]  Alan Mishchenko,et al.  Bi-Decomposition of Multi-Valued Relations , 2001 .

[4]  Szymon Jaroszewicz,et al.  An axiomatization of partition entropy , 2002, IEEE Trans. Inf. Theory.

[5]  Yiyu Yao,et al.  Probabilistic approaches to rough sets , 2003, Expert Syst. J. Knowl. Eng..

[6]  Tony T. Lee,et al.  An Infornation-Theoretic Analysis of Relational Databases—Part I: Data Dependencies and Information Metric , 1987, IEEE Transactions on Software Engineering.

[7]  H. A. Curtis,et al.  A new approach to The design of switching circuits , 1962 .

[8]  Sze-Tsen Hu.  ON THE DECOMPOSITION OF SWITCHING FUNCTIONS , 1961 .

[9]  C. J. Date.  An introduction to database systems (7. ed.) , 1999 .

[10]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[11]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[12]  S. Pfleeger,et al.  Introduction to discrete structures , 1985 .

[13]  Catriel Beeri,et al.  Properties of acyclic database schemes , 1981, STOC '81.

[14]  T. T. Lee.  An algebraic theory of relational databases , 1983, The Bell System Technical Journal.

[15]  Richard W. Hamming,et al.  Coding and Information Theory , 2018, Feynman Lectures on Computation.

[16]  F. E..  A Relational Model of Data Large Shared Data Banks , 2000 .

[17]  Claude E. Shannon,et al.  The lattice theory of information , 1953, Trans. IRE Prof. Group Inf. Theory.

[18]  José C. Monteiro,et al.  Finite state machine decomposition for low power , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[19]  Franco P. Preparata,et al.  Introduction to discrete structures , 1973 .

[20]  Jorma Rissanen,et al.  Independent components of relations , 1977, TODS.

[21]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[22]  Samuel Dolinar,et al.  A VLSI decomposition of the deBruijn graph , 1989, JACM.

[23]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[24]  Ivan Bratko,et al.  Machine Learning by Function Decomposition , 1997, ICML.

[25]  G. Rota,et al.  The Many Lives of Lattice Theory , 1998 .

[26]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[27]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .