Strategies for semantic caching

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One major problem with the use of mediator-based architectures is long query response times. An approach to shortening response times is to cache data at the mediator site. Recently, there has been growing interest in semantic query caching which may generally outperform the page and tuple caching approaches. In this paper, we present two semantic-region caching strategies with different storage granularities for mediators accessing relational databases. In contrast to most existing approaches, we do not only cache the projection result of queries but also the condition attributes, resulting in a higher cache hit rate. Additionally, we introduce the Profit-based Replacement algorithm with Aging Counter (PRAG), which incorporates the semantic notion of locality into the system.

Cite

CITATION STYLE

APA

Li, L., König-Ries, B., Pissinou, N., & Makki, K. (2001). Strategies for semantic caching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2113, pp. 284–298). Springer Verlag. https://doi.org/10.1007/3-540-44759-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free