Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Graph based query trimming of conjunctive queries in semantic caching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Abbas, M.A. ; Centre for Distrib. & Semantic Comput. (CDSC), Mohammad Ali Jinnah Univ., Islamabad, Pakistan ; Qadir, M.A. ; Ahmad, M. ; Ali, T.
more authors

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.

Published in:

Emerging Technologies (ICET), 2011 7th International Conference on

Date of Conference:

5-6 Sept. 2011