Multilevel caching to speedup query processing in distributed databases

Abstract

Query caching has been utilized efficiently to improve query processing in dismbuted database environments. Most prior caching techniques are based on single-level caching of previous query results. This is basically to avoid accessing the underlying databases each time a user submits the same query. In this paper, we propose a new methodology that allows caching a combination of both plans and results of prior queries in a multilevel caching architecture. The objective is to reduce the response time of distributed query processing and hence increase the system throughput.

Modeling and analysis of a multi-level caching database system

“…For example, we can divide the 1 GB cache roughly into 4 linear levels as described in Table 2. [11]. Our results show that caching query execution plans in a multi-level caching architecture significantly improve the query optimization time comparable to regular optimizer and single level caching.…”

“…To overcome these drawbacks, we proposed a new query caching approach that is based on caching query plans and some results in a multi-level caching architecture. We initially suggested this approach in [11]. In this paper, we developed an analytical model to evaluate the performance of the proposed architecture when it is implemented to run on a single computer.…”