期刊文献+

DICE:An Effective Query Result Cache for Distributed Storage Systems 被引量:1

DICE:An Effective Query Result Cache for Distributed Storage Systems
原文传递
导出
摘要 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. 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.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2010年第5期933-944,共12页 计算机科学技术学报(英文版)
基金 supported by National Research Foundation of Korea under Grant No.2010-0016165 supported by the IT R&D Program of MIC/IITA under Grant No.2007-S-016-02.
关键词 distributed system range query query caching Interval Skip List cache replacement distributed system range query query caching Interval Skip List cache replacement
  • 相关文献

参考文献17

  • 1Chang F, Dean J, Ghemawat S, Hsieh W C, Wallach D A, Burrows M, Chandra T, Fikes A, Gruber R. BigTable: A distributed storage system for structured data. In Proc. the 7th Symposium on Operating Systems Design and Implementation (0SDI2006), Seattle, USA, Nov. 6-7, 2006, pp.205-218.
  • 2DeCandia G, Hastorun D, Jampani M, Kakulapati G, Lakshman A, Pilchin A, Sivasubramanian S, Vosshall P, Vogels W. Dynamo: Amazon's highly available key-value store. In Proe. the 21st ACM Symposium on Operating Systems Principles (SOSP2007), Stevenson, USA, Oct. 14-17, 2007, pp.205-220.
  • 3HBase. http://hadoop.apache.org/hbase/.
  • 4Aguilera M K, Golab W, Shah M A. A practical scalable distributed b-tree. In Proc. the VLDB Endowment, 2008, 1(1): 598-609.
  • 5Hanson E N, Johnson T. Selection predicate indexing for active databases using interval skip lists. Information Systems, 1996, 21(3): 269-298.
  • 6COMER D. Ubiquitous B-tree. Computing Survey, 1979, 11(2): 121-137.
  • 7Rowstron A I T, Druschel P. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. IFIP/A CM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov. 12-16, 2010, pp.329-350.
  • 8Ratnasamy S, Francis P, Handley M, Karp R M, Shenker S. A scalable content-addressable network. In Proe. the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, San Diego, USA, Aug. 27-31, 2001, pp.161-172.
  • 9Stoica I, Morris R, Karger D R, Kaashoek M F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, San Diego, USA, Aug. 27-31, 2001, pp.149 160.
  • 10Abdallah M., Le H. C. Scalable range query processing for large-scale distributed database applications. In Proc. International Conference on Parallel and Distributed Computing Systems, Phoenix, USA, Nov. 4-16, 2005, pp.433-439.

同被引文献4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部