A Performance Analysis of Semantic Caching for XML Query Processing

Abstract

Caching is important for any system attempting to achieve high performance. The semantic caching is an approach trying to benefit from the certain knowledge of data semantics. The authors expect that this information might enable reuse of semantically close data rather than exactly equal to cached data in the traditional system. However, the major obstacle for extensive application of semantic caching for any data model or query language is the computational complexity of the query containment problem, which is, in general, undecidable. In this article the authors introduce and compare three approximate conservative query matching algorithms for semantic caching of semi-structured queries. The authors then analyze their applicability for distributed query processing. Based on this analysis, the authors outline few scenarios where semantic caching can be beneficial for query processing in a distributed system of heterogeneous semi-structured information resources.

A coverage‐based approach for filtering and prioritizing regions in a semantic cache

“…Even with all the advantages that the semantic caching offers, it can sometimes lead to resources overuse without getting any cached data. 17,18 In fact, in the actual used semantic caching algorithms, each new user query should be checked whether it is contained in the mediator's cache or not. This verification process is generally done by comparing the user query with the whole semantic regions' formulas.…”