Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang 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 (OSDI 2006), Seattle, USA, Nov. 6-7, 2006, pp.205–218.
DeCandia 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 Proc. the 21st ACM Symposium on Operating Systems Principles (SOSP 2007), Stevenson, USA, Oct. 14-17, 2007, pp.205–220.
HBase. http://hadoop.apache.org/hbase/.
Aguilera M K, Golab W, Shah M A. A practical scalable distributed b-tree. In Proc. the VLDB Endowment, 2008, 1(1): 598–609.
Hanson E N, Johnson T. Selection predicate indexing for active databases using interval skip lists. Information Systems, 1996, 21(3): 269–298.
COMER D. Ubiquitous B-tree. Computing Survey, 1979, 11(2): 121–137.
Rowstron A I T, Druschel P. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov. 12-16, 2010, pp.329–350.
Ratnasamy S, Francis P, Handley M, Karp R M, Shenker S. A scalable content-addressable network. In Proc. the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, San Diego, USA, Aug. 27-31, 2001, pp.161–172.
Stoica 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.
Abdallah 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.
Skobeltsyn G, Aberer K. Distributed cache table: Efficient query-driven processing of multi-term queries in p2p networks. In Workshop on Information Retrieval in Peer-to-Peer Networks (P2PIR 2006), Arlington, USA, Nov. 11, 2006.
Effelsberg W, Härder T. Principles of database buffer management. ACM Trans. Database Syst., 1984, 9(4): 560–595.
O'Neil E J, O'Neil P E, Weikum G. The LRU-K page replacement algorithm for database disk buffering. In Proc. ACM SIGMOD Conference, Washington DC, USA, June, 1993, pp.297–306.
Johnson T, Shasha D. 2Q: A low overhead high performance buffer management replacement algorithm. In Proc. VLDB Conference, San Diego de Chile, Sept. 12-15, 1994, pp.439–450.
Min J K. Beast: A buffer replacement algorithm using spatial and temporal locality. In Proc. International Conference of Computational Science and Its Applications, 2006, pp.67–76.
Lee D, Choi J, Kim J H, Noh S H, Min S L, Cho Y, Kim C S. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Computers, 2001, 50(12): 1352–1361.
S.HD502HI. http://www.ewiz.com/detail.php?name=HD-HD502HI.
Author information
Authors and Affiliations
Corresponding author
Additional information
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.
Rights and permissions
About this article
Cite this article
Min, JK., Lee, MY. DICE: An Effective Query Result Cache for Distributed Storage Systems. J. Comput. Sci. Technol. 25, 933–944 (2010). https://doi.org/10.1007/s11390-010-9378-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-010-9378-1