This article describes an experiment demonstrating the running time of the algorithm for maintainance of external consistency in algebraic Bayesian networks. In the experiment, the stellate and chain structures of algebraic Bayesian networks are compared. The results of the experiment demonstrate the dependency of the algorithm complexity on the number of atoms in the network, as well as on the intersections and in the fragments of knowledge.