Graph based query trimming of conjunctive queries in semantic caching
Muhammad Azeem Abbas, Muhammad Abdul Qadir, Munir Ahmad, Tariq Ali, Naseer Ahmed Sajid · 2011
In semantic cache query processing, an important step is query trimming. Trimming a query can potentially reduce the answer size that is required to retrieve from a remote server. Existing query trimming technique is based on Boolean logic, which inhibits several shortcomings such as after trimming it expands number of predicate terms and induces disjunction even if conjunctive queries are under consideration. It trims the query segment wise and can not process the combined semantics of all the segments in a cache. In this paper we propose a query trimming technique that is based on variation of modeling approach (graph based) used for satisfiability and implication testing. We demonstrated with a case study that our proposed technique overcomes limitations of the previous query trimming technique and hence improves semantic cache query processing.