Computing Multiple Queries
Marc Pouly, Jürg Kohlas · 2011
During a single run of the collect algorithm on a covering join tree (V, E, A, D), exactly |E| messages are computed and transmitted. This chapter presents the arising algorithm called the Shenoy-Shafer architecture. It reduces the number of computed messages to 2|E| for an arbitrary number of queries. The chapter introduces the Lauritzen-Spiegelhalter architecture, HUGIN architecture and idempotent Architecture. More concretely, they presuppose some concept of division that will be defined. Essentially, there are three requirements for introducing a division operator, namely either separativity, regularity or idempotency. Based on the division operator, scaling or normalization can be introduced on a generic, algebraic level as explored in the chapter. Moreover, it is then also required that the solution of inference problems gives scaled results. Therefore the chapter focuses on how the local computation architectures can be adapted to deliver scaled results directly. Controlled Vocabulary Terms evolutionary computation; fifth generation systems; query formulation