We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Volume 25 Issue 5
August  2010
Turn off MathJax
Article Contents
Jun-Ki Min, Mi-Young Lee. DICE: An Effective Query Result Cache for Distributed Storage Systems[J]. Journal of Computer Science and Technology, 2010, 25(5): 933-944.
Citation: Jun-Ki Min, Mi-Young Lee. DICE: An Effective Query Result Cache for Distributed Storage Systems[J]. Journal of Computer Science and Technology, 2010, 25(5): 933-944.

DICE: An Effective Query Result Cache for Distributed Storage Systems

Funds: This work was partially supported by National Research Foundation of Korea under Grant No. 2010-0016165, and partially supported by the IT R\&D Program of MIC/IITA under Grant No. 2007-S-016-02.
More Information
  • Author Bio:

    Jun-Ki Min is a professor in the School of Internet-Media at the Korea University of Technology and Education (KUT). He received his Ph.D. degree from the Korea Advanced Institute of Science and Technology (KAIST), in 2002. He was a senior researcher in Electronics and Telecommunications Research Institute (ETRI), Korea. While at ETRI, he developed UbiCore, which is a large volume stream data management system. He has written and published several articles in international journals and conference proceedings. His current research interests include XML, semantic Web, sensor network and stream data management.

    Mi-Young Lee is a principal research engineer of Electronics and Telecommunications Research Institute. She received the M.S. degree from Seoul National University in 1983 and the Ph.D. degree from ChungNam National University in 2006. From 1988, she has researched in database technology and has been involved in many projects of ETRI including XML storage system, UbiCore (stream data management system), GLORY-DB (distributed storage system). Her current research interests include database system, information integration, event stream processing system and distributed computing system.

  • Received Date: July 12, 2009
  • Revised Date: April 20, 2010
  • Published Date: August 31, 2010
  • 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 efficient 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 efficient than traditional buffer replacement algorithms. Our experimental result demonstrates the efficiency of our proposed technique.

Catalog

    Article views (13) PDF downloads (1879) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return