Representation of Bayesian networks as relational databases

  • S. K. M. Wong
  • Y. Xiang
  • X. Nie
Part of the Lecture Notes in Computer Science book series (LNCS, volume 945)


This paper suggests a representation of Bayesian networks based on a generalized relational database model. The main advantage of this representation is that it takes full advantage of the capabilities of conventional relational database systems for probabilistic inference. Belief update, for example, can be processed as an ordinary query, and the techniques for query optimization are directly applicable to updating beliefs. The results of this paper also establish a link between knowledge-based systems for probabilistic reasoning and relational databases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Beeri, R. Fagin, D. Maier and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the Association for Computing Machinery, 30(3):479–513, 1983.Google Scholar
  2. 2.
    C.K. Chow and C.N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462–467, 1968.Google Scholar
  3. 3.
    G.F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309–347, 1992.Google Scholar
  4. 4.
    M. Henrion and M.J. Druzdzel. Qualitative propagation and scenario-based approaches to explanation of probabilistic reasoning. Proc. Sixth Conference on Uncertainty in Artificial Intelligence, pages 10–20, Cambridge, Mass., 1990.Google Scholar
  5. 5.
    F.V. Jensen. Junction tree and decomposable hypergraphs. Technical report, JUDEX, Aalborg, Denmark, February 1988.Google Scholar
  6. 6.
    F.V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4:269–282, 1990.Google Scholar
  7. 7.
    S.L. Lauritzen and D.J. Spiegelhalter. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50:157–244, 1988.Google Scholar
  8. 8.
    D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.Google Scholar
  9. 9.
    R.E. Neapolitan. Probabilistic Reasoning in Expert Systems. John Wiley and Sons, 1990.Google Scholar
  10. 10.
    J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.Google Scholar
  11. 11.
    G. Shafer. An axiomatic study of computation in hypertrees. School of Business Working Paper Series, (232), University of Kansas, Lawrence, 1991.Google Scholar
  12. 12.
    D.J. Spiegelhalter, R.C.G. Franklin, and K. Bull. Assessment, criticism and improvement of imprecise subjective probabilities for a medical expert system. Proc. Fifth Workshop on Uncertainty in Artificial Intelligence, pages 335–342, Windsor, Ontario, 1989.Google Scholar
  13. 13.
    W.X. Wen. From relational databases to belief networks. B. D'Ambrosio, P. Smets, and P.P. Bonissone, editors, Proc. Seventh Conference on Uncertainty in Artificial Intelligence, pages 406–413. Morgan Kaufmann, 1991.Google Scholar
  14. 14.
    Y. Xiang, M.P. Beddoes, and D. Poole. Sequential updating conditional probability in Bayesian networks by posterior probability. Proc. 8th Biennial Conf. Canadian Society for Computational Studies of Intelligence, pages 21–27, Ottawa, 1990.Google Scholar
  15. 15.
    Y. Xiang, D. Poole, and M. P. Beddoes. Multiply sectioned Bayesian networks and junction forests for large knowledge based systems. Computational Intelligence, 9(2):171–220, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • S. K. M. Wong
    • 1
  • Y. Xiang
    • 1
  • X. Nie
    • 1
  1. 1.Department of Computer ScienceUniversity of ReginaReginaCanada

Personalised recommendations