{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:00:52Z","timestamp":1771700452102,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"MOST\u2019s 13th FYP project of China","award":["2016YFB1000202"],"award-info":[{"award-number":["2016YFB1000202"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61303056"],"award-info":[{"award-number":["61303056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10766-016-0472-z","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T15:04:01Z","timestamp":1478876641000},"page":"1310-1325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["dCompaction: Delayed Compaction for the LSM-Tree"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6125-7681","authenticated-orcid":false,"given":"Fengfeng","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinliang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"472_CR1","doi-asserted-by":"crossref","unstructured":"Sears, R., Ramakrishnan, R.: bLSM: a general purpose log-structured merge tree. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201912, pp. 217\u2013228. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2213836.2213862"},{"key":"472_CR2","unstructured":"Google: LevelDB. http:\/\/code.google.com\/p\/LevelDB (2012)"},{"key":"472_CR3","unstructured":"Facebook: RocksDB. http:\/\/rocksdb.org\/ (2013)"},{"key":"472_CR4","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. In: OSDI 2006: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation, pp 15\u201325. USENIX Association, Berkeley, CA, USA (2006)"},{"issue":"2","key":"472_CR5","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[J]. ACM SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"472_CR6","unstructured":"HBase Documentation. Hbase: Bigtable-like structured storage for hadoop hdfs. http:\/\/wiki.apache.org\/hadoop\/Hbasea , (2011)"},{"issue":"4","key":"472_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"PO Neil","year":"1996","unstructured":"Neil, P.O., Cheng, E., Gawlick, D., Neil, E.O.: The log-structured merge-tree (LSM-tree). Acta Inf. 33(4), 351\u2013385 (1996)","journal-title":"Acta Inf."},{"key":"472_CR8","unstructured":"Redis: http:\/\/redis.io\/"},{"key":"472_CR9","unstructured":"Memcached: http:\/\/memcached.org\/"},{"key":"472_CR10","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: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP\u201903)","DOI":"10.1145\/2517349.2522722"},{"key":"472_CR11","doi-asserted-by":"crossref","unstructured":"Atikoglu, B., Yuehai, X., Frachtenberg, E., Jiang, S., Paleczny, M.: Workload analysis of a large-scale key-value store. In: SIGMETRICS (2012)","DOI":"10.1145\/2254756.2254766"},{"key":"472_CR12","unstructured":"Shetty, P., Spillane, R., el at.: Building workload-independent storage with VT-trees. In: 11th USENIX Conference on File and Storage Technologies (2013)"},{"issue":"4","key":"472_CR13","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. VLDB J. 16(4), 417\u2013437 (2007)","journal-title":"VLDB J."},{"key":"472_CR14","doi-asserted-by":"crossref","unstructured":"Zigang, Z., Yinliang, Y., Bingsheng, H., et al.: Pipelined compaction for the LSM-tree. In: 28th International Parallel and Distributed Processing Symposium, pp. 777\u2013786 (2014)","DOI":"10.1109\/IPDPS.2014.85"},{"key":"472_CR15","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC\u201900, pp. 143\u2013154. ACM, New York, NY, USA (2010)","DOI":"10.1145\/1807128.1807152"},{"issue":"4","key":"472_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2377677.2377681","volume":"42","author":"R Escriva","year":"2012","unstructured":"Escriva, R., Wong, B., Sirer, E.G.: HyperDex: a distributed, searchable key-value store. SIGCOMM Comput. Commun. Rev. 42(4), 25\u201336 (2012)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"472_CR17","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Fineman, J.T., Fogel, Y.R., Kuszmaul, B.C., Nelson, J.: Cache-oblivious streaming b-trees. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201907), pp. 81\u201392. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1248377.1248393"},{"key":"472_CR18","doi-asserted-by":"crossref","unstructured":"Spillane, R.P., Shetty, P.J., Zadok, E., Dixit, S., Archak, S.: An efficient multi-tier tablet server storage architecture. In: Proceedings of the 2nd ACM Symposium on Cloud Computing, SOCC\u201911, pp. 1\u201314. ACM, New York, NY, USA (2011)","DOI":"10.1145\/2038916.2038917"},{"issue":"1\u20132","key":"472_CR19","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., Luo, Q., Yi, K.: Tree indexing on solid state drives. Proc. VLDB Endow. 3(1\u20132), 1195\u20131206 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"472_CR20","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: a data structuring technique with geometric applications. In: Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pp. 90\u2013100. Springer, Berlin Heidelberg (1985)","DOI":"10.1007\/BFb0015734"},{"issue":"7","key":"472_CR21","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"472_CR22","unstructured":"Wu, X., et al.: LSM-trie: an LSM-treebased ultra-large key-value store for small data. In: USENIX Annual Technical Conference (2015)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-016-0472-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0472-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0472-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:27:20Z","timestamp":1749727640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-016-0472-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s10766-016-0472-z","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}