Journal
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 110, Issue -, Pages 42-51Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2017.04.011
Keywords
Semantic cache; Data consistency; Cache hit; Cache miss
Categories
Funding
- Shandong Provincial Natural Science Foundation [ZR2014FQ029, ZR2016FB14]
- Shandong Provincial Key RD Program [2015GGX106007, 2016ZDJSO1Al2]
- Open Project Funding of Shandong Provincial Key Laboratory of Software Engineering [2015SE03]
- Project of Shandong Province Higher Educational Science and Technology Program [J16LN13, J16LN07]
- National Natural Science Foundation of China [61640218]
Ask authors/readers for more resources
In recent years, researches focus on addressing the query bottleneck issue using semantic cache. However, the challenges of this method are how to increase cache hit ratio, decrease the query processing time, and address cache consistency issue. In this paper, we construct segment access-aware dynamic semantic cache for relational databases. Some definitions of semantic segment, probe query, and remainder query are proposed to describe the semantic cache. Then, estimation of the query result is proposed. Next, cache access algorithm of our proposed segment access-aware dynamic semantic cache is presented in case of cache exact hit, cache extended hit, cache partial hit and cache miss. Cache item with effective lifecycle tag is proposed to address cache consistency issue. Finally, experimental results show that this approach performs better than regular semantic cache and decisional semantic cache. (C) 2017 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available