How to ProcessInference Queries in Probabilistic Databases?
<font size=6><font color=#AA0066>Processing of Inference Queries in Probabilistic Databases wireless</font</font>>
Real world applications like sensor network monitoring,that deal with wide existence of uncertain factors, employ relational
databases to describe the probability distribution of all variables in its environment Such probability distribution data finds extensive usage through inference queries. In practice, however, rather than a single probabilistic inference query, applications pose multiple but usually similar probabilistic interference queries to the system. An environment that involves frequent inference queries on relational databases provides a possibility of applying â€˜Computation sharingâ€™ logic among different queries.CTP is introduced in databases for probabilistic inference queries. Such an approach provides two opportunities for computation sharing. First opportunity is an existence of many common variables that needed to be eliminated during the evaluation of different queries. Second opportunity refers to the variables appearing frequently in the queries that can be cached and reused in later queries. The materialized views are used to cache the intermediate results of the previous inference queries, which might be shared with the following queries, and consequently reduce the time cost. When a similar query comes and requests the
elimination of the same variables, the inference query can reuse these cached materialized views to avoid re-eliminating the common variables again. Variables that appear frequently in the query workload can be efficiently processed by caching and reusing the intermediate computation results. The work focuses on how a sequence of Probabilistic Inference queries can be efficiently processed with the application of computation sharing logic, which can highly optimize query performance.