An information-lossless decomposition theory of relational information systems

IEEE Transactions on Information Theory

Volumn 52, Issue 5, 2006, Pages 1890-1903

  Lee, Tony T ^a   Lo, Terry Y ^a   Wang, Jianfang ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

Bipartite graph; Commutative partitions; Entropy; Running intersection property

Indexed keywords

ALGEBRA; DATABASE SYSTEMS; FINITE AUTOMATA; GRAPH THEORY; LARGE SCALE SYSTEMS; LOGIC CIRCUITS; TOPOLOGY;

BIPARTITE GRAPH; COMMUTATIVE PARTITIONS; FINITE-STATE MACHINES; INFORMATION-LOSSLESS DECOMPOSITION THEORY; RELATIONAL DATABASES; RELATIONAL INFORMATION SYSTEMS; SHANNON'S ENTROPY;

INFORMATION THEORY;

EID: 33646017699     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.872860     Document Type: Article

References (28)

1. G. Birkhoff, Lattice Theory, 2nd ed. Providence, RI: AMS, 1948, vol. 25, American Mathematical Society Colloquium Publications.
2. G. C. Rota, "The many lives of lattice theory," Notices Amer. Math. Soc., vol. 44, no. 11, pp. 1440-1445, 1997.
3. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Jul./Oct. 1948.
4. C. E. Shannon, "The lattice theory of information," IRE Trans. Inf. Theory, vol. 1, no. 1, pp. 105-107, Feb. 1950.
5. T. T. Lee, "An information-theoretic analysis of relational database, Part I. Data dependencies and information metric," IEEE Trans. Software Eng., vol. 13, no. 10, pp. 1049-1061, Oct. 1987.
6. J. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines. Englewood Cliffs, NJ: Prentice-Hall, 1966.
7. D. Lee and M. Yannakakis, "Principles and methods of testing finite state machines," Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
8. M. A. Perkowski and S. Grygiel, A Survey of Literature on Function Decomposition Version IV: Portland State Univ., 1995.
9. R. W. Hamming and E. A. Feigenbaum, Switching and Finite Automata Theory. New York: McGraw-Hill, 1970.
10. B. Zupan, M. Bohanec, I. Bratko, and J. Demsar, "Machine learning by function decomposition," in Proc. Int. Conf. Machine Learning, Nashville, TN, 1997, pp. 421-429.
11. R. W. Hamming, Coding and Information Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1986.
12. F. P. Preparata and R. T. Yeh, Introduction to Discrete Structures. Reading, MA: Addison-Wesley, 1973, pp. 199-202.
13. J. C. Monteiro and A. L. Oliveira, "Finite state machine decomposition for low power," in Proc. Design Automation Conf., Jun. 1998, pp. 758-763.
14. A. Mishchenko, B. Steinbach, and M. Perkowski, "Bi-decomposition of multi-valued relations," in Proc. Int. Workshop on Logic and Synthesis, Lake Tahoe, CA, Jun. 2001, pp. 35-40.
15. C. Lang and B. Steinbach, "Decomposition of multi-valued functions into min- and max-gates," Proc. 31st IEEE Int. Symp. Maltiple-Valued Logic, pp. 173-178, 2001.
16. O. Collins, S. Dolinar, R. McEliece, and F. Pollara, "A VLSI decomposition of the deBruijn," J. Assoc. Comp. Mach., vol. 39, no. 4, pp. 931-948, Oct. 1992.
17. R. L. Ashenhurst, "The Decomposition of Switching Functions," Bell Laboratories, Tech. Rep. BL-1(11), 1952.
18. H. A. Curtis, A New Approach to the Design of Switching Circuits. Princeton, NJ: Van Nostrand, 1962.
19. S. Cicerone, D. Frigioni, and P. Di Felice, "A general strategy for decomposing topological invariants of spatial databases and an application," Data Knowl. Eng., vol. 42, no. 1, pp. 57-87, 2002.
20. C. J. Date, An Introduction to Database Systems, 8th ed. Reading, MA: Addison-Wesley, 1999.
21. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, "On the desirability of acyclic database schemes," J. Assoc. Comp. Mach., vol. 30, no. 3, pp. 479-513, 1983.
22. E. F. Codd, "A relational model of data for large shared data banks," Commun. ACM, vol. 13, no. 6, pp. 377-387, Jun. 1970.
23. J. Rissanen, "Independent components of relations," ACM Trans. Database Systesm, vol. 2, no. 4, pp. 317-325, Dec. 1977.
24. T. T. Lee, "Algebraic theory of relational databases," Bell Syst. Tech. J., vol. 62, no. 10, pp. 3159-3204, Dec. 1983.
25. C. Beeri, R. Fagin, D. Maier, A. O. Mendelson, J. D. Ullman, and M. Yannakakis, "Properties of acyclic database schemes," in Proc. 13th Annu. ACM Symp. Theory of Computing, Milwaukee, WI, 1981, pp. 355-362.
26. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
27. D. A. Simovici and S. Jaroszewicz, "An axiomatization of partition entropy," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 2138-2142, Jul. 2002.
28. Y. Y. Yao, "Probabilistic approaches to rough sets," Expert Systems, vol. 20, no. 5, pp. 287-297, 2003.