{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:14:36Z","timestamp":1783700076474,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11390-017-1704-4","type":"journal-article","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T07:22:35Z","timestamp":1483687355000},"page":"41-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction"],"prefix":"10.1007","volume":"32","author":[{"given":"Feng-Feng","family":"Pan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yin-Liang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"1704_CR1","doi-asserted-by":"crossref","unstructured":"Sears R, Ramakrishnan R. bLSM: A general purpose logstructured merge tree. In Proc. the ACM SIGMOD International Conference on Management of Data, May 2012, pp.217-228.","DOI":"10.1145\/2213836.2213862"},{"key":"1704_CR2","doi-asserted-by":"crossref","unstructured":"Huang Q, Birman K, van Renesse R, Lloyd W, Kumar S, Li H C. An analysis of Facebook photo caching. In Proc. the 24th ACM Symposium on Operating Systems Principles (SOSP), Nov. 2013, pp.167-181.","DOI":"10.1145\/2517349.2522722"},{"key":"1704_CR3","doi-asserted-by":"crossref","unstructured":"Atikoglu B, Xu Y, Frachtenberg E et al. Workload analysis of a large-scale key-value store. In Proc. ACM SIGMETRICS, Jun. 2012, pp.53-64.","DOI":"10.1145\/2254756.2254766"},{"issue":"4","key":"1704_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil P, Cheng E, Gawlick D et al. The log-structured merge-tree (LSM-tree). Acta Informatica, 1996, 33(4): 351-385.","journal-title":"Acta Informatica"},{"key":"1704_CR5","unstructured":"Chang F, Dean J, Ghemawat S, Hsieh W, Wallach D, Burrows M, Chandra T, Fikes A, Gruber R. Bigtable: A distributed storage system for structured data. In Proc. the 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), Nov. 2006, pp.205-218."},{"issue":"2","key":"1704_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman A, Malik P. Cassandra: A decentralized structured storage system. ACM SIGOPS Operating Systems Review, 2010, 44(2): 35-40.","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"1704_CR7","unstructured":"George L. HBase: The Definitive Guide. O\u2019Reilly Media, 2011."},{"key":"1704_CR8","doi-asserted-by":"crossref","unstructured":"Escriva R, Wong B, Sirer E. HyperDex: A distributed, searchable key-value store. In Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Communication, Aug. 2012, pp.25-36.","DOI":"10.1145\/2342356.2342360"},{"issue":"2","key":"1704_CR9","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.14778\/1454159.1454167","volume":"1","author":"B Cooper","year":"2008","unstructured":"Cooper B, Ramakrishnan R, Srivastava U, Silberstein A, Bohannon P, Jacobsen H, Puz N, Weaver D, Yerneni R. PNUTS: Yahoo! hosted data serving platform. Proc. the VLDB Endowment, 2008, 1(2): 1277-1288.","journal-title":"Proc. the VLDB Endowment"},{"key":"1704_CR10","unstructured":"Shetty P, Spillane R, Malpani R et al. Building workloadindependent storage with VT-trees. In Proc. the 11th USENIX Conference on File and Storage Technologies (FAST), Feb. 2013, pp.17-30."},{"issue":"4","key":"1704_CR11","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s00778-005-0171-7","volume":"16","author":"C Jermaine","year":"2007","unstructured":"Jermaine C, Omiecinski E, Yee W G. The partitioned exponential file for database storage management. The VLDB Journal, 2007, 16(4): 417-437.","journal-title":"The VLDB Journal"},{"key":"1704_CR12","doi-asserted-by":"crossref","unstructured":"Zhong Z, Yue Y, He B et al. Pipelined compaction for the LSM-tree. In Proc. the 28th International Parallel and Distributed Processing Symposium (IPDPS), May 2014, pp.777-786.","DOI":"10.1109\/IPDPS.2014.85"},{"key":"1704_CR13","unstructured":"Wu X, Xu Y, Shao Z et al. LSM-trie: An LSM-tree-based ultra-large key-value store for small data. In Proc. the USENIX Annual Technical Conference (ATC), Jul. 2015, pp.71-82."},{"key":"1704_CR14","unstructured":"Amur H, Andersen D, Kaminsky M et al. Design of a writeoptimized data store. Technical Report GIT-CERCS-13-08, Georgia Tech CERCS, 2013."},{"key":"1704_CR15","doi-asserted-by":"crossref","unstructured":"Cooper B, Silberstein A, Tam E, Ramakrishnan R, Sears R. Benchmarking cloud serving systems with YCSB. In Proc. the 1st ACM Symposium on Cloud Computing (SoCC), Jun. 2010, pp.143-154.","DOI":"10.1145\/1807128.1807152"},{"key":"1704_CR16","doi-asserted-by":"crossref","unstructured":"Spillane R, Shetty P, Zadok E, Dixit S, Archak S. An efficient multi-tier tablet server storage architecture. In Proc. the 2nd ACM Symposium on Cloud Computing in Conjunction with SOSP (SoCC), Oct. 2011, pp.1-14.","DOI":"10.1145\/2038916.2038917"},{"issue":"7","key":"1704_CR17","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"H Bloom","year":"1970","unstructured":"Bloom H. Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970, 13(7): 422-426.","journal-title":"Communications of the ACM"},{"key":"1704_CR18","doi-asserted-by":"crossref","unstructured":"Chazelle B, Guibas L. Fractional cascading: A data structuring technique with geometric applications. In Proc. the 12th International Colloquium on Automata, Languages, and Programming (ICALP), Jul. 1985, pp.90-100.","DOI":"10.1007\/BFb0015734"},{"key":"1704_CR19","doi-asserted-by":"crossref","unstructured":"Bender M, Farach-Colton M, Fineman J, Fogel Y, Kuszmaul B, Nelson J. Cache-oblivious streaming B-trees. In Proc. the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Jun. 2007, pp.81-92.","DOI":"10.1145\/1248377.1248393"},{"issue":"1\/2","key":"1704_CR20","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.14778\/1920841.1920990","volume":"3","author":"Y Li","year":"2010","unstructured":"Li Y, He B, Yang R J et al. Tree indexing on solid state drives. Proc. the VLDB Endowment, 2010, 3(1\/2): 1195-1206.","journal-title":"Proc. the VLDB Endowment"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1704-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-017-1704-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1704-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:27:31Z","timestamp":1498375651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-017-1704-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1704"],"URL":"https:\/\/doi.org\/10.1007\/s11390-017-1704-4","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}