{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:32:06Z","timestamp":1726414326679},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s11390-010-9378-1","type":"journal-article","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T09:12:13Z","timestamp":1283677933000},"page":"933-944","source":"Crossref","is-referenced-by-count":1,"title":["DICE: An Effective Query Result Cache for Distributed Storage Systems"],"prefix":"10.1007","volume":"25","author":[{"given":"Jun-Ki","family":"Min","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi-Young","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,10]]},"reference":[{"key":"9378_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013218.","DOI":"10.1145\/1365815.1365816"},{"key":"9378_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013220.","DOI":"10.1145\/1294261.1294281"},{"key":"9378_CR3","unstructured":"HBase. http:\/\/hadoop.apache.org\/hbase\/ ."},{"issue":"1","key":"9378_CR4","doi-asserted-by":"crossref","first-page":"598","DOI":"10.14778\/1453856.1453922","volume":"1","author":"MK Aguilera","year":"2008","unstructured":"Aguilera M K, Golab W, Shah M A. A practical scalable distributed b-tree. In Proc. the VLDB Endowment, 2008, 1(1): 598\u2013609.","journal-title":"In Proc. the VLDB Endowment"},{"issue":"3","key":"9378_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0306-4379(96)00015-4","volume":"21","author":"EN Hanson","year":"1996","unstructured":"Hanson E N, Johnson T. Selection predicate indexing for active databases using interval skip lists. Information Systems, 1996, 21(3): 269\u2013298.","journal-title":"Information Systems"},{"issue":"2","key":"9378_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"COMER D. Ubiquitous B-tree. Computing Survey, 1979, 11(2): 121\u2013137.","journal-title":"Computing Survey"},{"key":"9378_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013350.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"9378_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013172.","DOI":"10.1145\/964723.383072"},{"key":"9378_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013160.","DOI":"10.1145\/383059.383071"},{"key":"9378_CR10","unstructured":"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\u2013439."},{"key":"9378_CR11","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/1183579.1183586"},{"issue":"4","key":"9378_CR12","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W Effelsberg","year":"1984","unstructured":"Effelsberg W, H\u00e4rder T. Principles of database buffer management. ACM Trans. Database Syst., 1984, 9(4): 560\u2013595.","journal-title":"ACM Trans. Database Syst."},{"key":"9378_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013306.","DOI":"10.1145\/170035.170081"},{"key":"9378_CR14","unstructured":"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\u2013450."},{"key":"9378_CR15","doi-asserted-by":"crossref","unstructured":"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\u201376.","DOI":"10.1007\/11751588_8"},{"issue":"12","key":"9378_CR16","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D Lee","year":"2001","unstructured":"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\u20131361.","journal-title":"IEEE Trans. Computers"},{"key":"9378_CR17","unstructured":"S.HD502HI. http:\/\/www.ewiz.com\/detail.php?name=HD-HD502HI ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9378-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-010-9378-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9378-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:05:48Z","timestamp":1559581548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-010-9378-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9378"],"URL":"https:\/\/doi.org\/10.1007\/s11390-010-9378-1","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}