One of the primary tasks arising in the theory of algebraic Bayesian networks is the task of checking and maintaining the consistency of a knowledge pattern. Now, there are algorithms for solving this problem, but in computer science and programming, it is extremely important to understand the computational complexity of the methods used. This paper is devoted to estimating the number of steps of these algorithms.