A Performance Analysis of Semantic Caching for Distributed Semi-structured Query Processing

  • Boris Novikov
  • Alice Pigul
  • Anna Yarygina
Conference paper

DOI: 10.1007/978-3-642-15576-5_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6295)
Cite this paper as:
Novikov B., Pigul A., Yarygina A. (2010) A Performance Analysis of Semantic Caching for Distributed Semi-structured Query Processing. In: Catania B., Ivanović M., Thalheim B. (eds) Advances in Databases and Information Systems. ADBIS 2010. Lecture Notes in Computer Science, vol 6295. Springer, Berlin, Heidelberg

Abstract

Caching is important for any system attempting to achieve high performance. The semantic caching is an approach trying to benefit from certain semantical knowledge of the data to be processed.

The expectation is that semantical information might help to reduce the number of cache misses and in certain cases even avoid queries to the primary data. However, the major obstacle for wide application of semantic caching is the query containment problem which is computationally hard.

In this paper we introduce an approximate conservative algorithm for semantic caching of semistructured queries and analyze its applicability for distributed query processing. Based on this analysis, we outline few scenarios where semantic caching can be benefitial for query processing in a distributed system of heterogeneous semi-structured information resources.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Boris Novikov
    • 1
  • Alice Pigul
    • 1
  • Anna Yarygina
    • 1
  1. 1.Saint-Petersburg University 

Personalised recommendations