상세정보
학술지
DICE: An Effective Query Result Cache for Distributed Storage Systems
- 저자
- 민준기, 이미영
- 발행일
- 201009
- 출처
- Journal of Computer Science and Technology, v.25 no.5, pp.933-944
- ISSN
- 1000-9000
- 출판사
- Springer
- 협약과제
- 10MS4400, 메모리 가상화 기반 데이터 폭증 대응형 플랫폼 기술 개발, 이미영
- 초록
- Due to the proliferation of Internet and Intranet, the distributed storage systems have received a lot of attention. These systems span a large number of machines and store huge amount of data for a lot of users. In the distributed storage systems, a row can be directly accessed using a row key. We concentrate on a problem of e짹cient processing of queries whose predicate is on a column but not a row key. In this paper, we present a cache management technique, called DICE which maintains query results of range queries to support the next range queries. To accelerate the search time of the cached query results, we use modified Interval Ski Lists. In addition, we devise a novel cache replacement policy since DICE maintains an interval rather than a data item. Since our cache replacement policy considers the properties of intervals, our proposed technique is more e짹cient than traditional buffer replacement algorithms. Our experimental result demonstrates the e짹ciency of our proposed technique. © 2010 Springer Science+Business Media, LLC & Science Press, China.
- 키워드
- Cache replacement, Distributed system, Interval Skip List, Query caching, Range query
- KSP 제안 키워드
- Buffer replacement, Cache management, Distributed System(DS), Experimental Result, Query Caching, Range queries, Replacement algorithm, Result cache, Search time, cache replacement policy, distributed storage systems