The Community for Technology Leaders
Green Image
Issue No. 04 - April (2011 vol. 23)
ISSN: 1041-4347
pp: 512-526
Shaoxu Song , Hong Kong University of Science and Technology, Hong Kong
Lei Chen , Hong Kong University of Science and Technology, Hong Kong
Jeffrey Xu Yu , The Chinese University of Hong Kong, Hong Kong
Existing solutions for probabilistic inference queries mainly focus on answering a single inference query, but seldom address the issues of efficiently returning results for a sequence of frequent queries, which is more popular and practical in many real applications. In this paper, we mainly study the computation caching and sharing among a sequence of inference queries in databases. The clique tree propagation (ctp) algorithm is first introduced in databases for probabilistic inference queries. We use the materialized views to cache the intermediate results of the previous inference queries, which might be shared with the following queries, and consequently reduce the time cost. Moreover, we take the query workload into account to identify the frequently queried variables. To optimize probabilistic inference queries with ctp, we cache these frequent query variables into the materialized views to maximize the reuse. Due to the existence of different query plans, we present heuristics to estimate costs and select the optimal query plan. Finally, we present the experimental evaluation in relational databases to illustrate the validity and superiority of our approaches in answering frequent probabilistic inference queries.
Probabilistic inference, variable elimination, clique tree propagation.

J. X. Yu, S. Song and L. Chen, "Answering Frequent Probabilistic Inference Queries in Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 512-526, 2010.
95 ms
(Ver 3.3 (11022016))