{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:48Z","timestamp":1746245628391,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050504"},{"type":"electronic","value":"9783030050511"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05051-1_7","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T16:38:48Z","timestamp":1544114328000},"page":"89-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Priority and Fairness Mixed Compaction Scheduling Mechanism for LSM-tree Based KV-Stores"],"prefix":"10.1007","author":[{"given":"Lidong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinliang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haobo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TC.2015.2435779","volume":"65","author":"J-S Ahn","year":"2016","unstructured":"Ahn, J.-S., Seo, C., Mayuram, R., Yaseen, R., Kim, J.-S., Maeng, S.: ForestDB: a fast key-value storage system for variable-length string keys. IEEE Trans. Comput. 65(3), 902\u2013915 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR2","volume-title":"Redis in Action","author":"JL Carlson","year":"2013","unstructured":"Carlson, J.L.: Redis in Action. Manning Publications Co., Shelter Island (2013)"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.14778\/1454159.1454167","volume":"1","author":"BF Cooper","year":"2008","unstructured":"Cooper, B.F., et al.: PNUTS: Yahoo!\u2019s hosted data serving platform. Proc. VLDB Endow. 1(2), 1277\u20131288 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR4","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, pp. 143\u2013154. ACM (2010)","DOI":"10.1145\/1807128.1807152"},{"issue":"1\u20132","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.14778\/1920841.1921015","volume":"3","author":"B Debnath","year":"2010","unstructured":"Debnath, B., Sengupta, S., Li, J.: FlashStore: high throughput persistent key-value store. Proc. VLDB Endow. 3(1\u20132), 1414\u20131425 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Debnath, B., Sengupta, S., Li, J.: SkimpyStash: RAM space skimpy key-value store on flash-based storage. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 25\u201336. ACM (2011)","DOI":"10.1145\/1989323.1989327"},{"issue":"124","key":"7_CR7","first-page":"5","volume":"2004","author":"B Fitzpatrick","year":"2004","unstructured":"Fitzpatrick, B.: Distributed caching with memcached. Linux J. 2004(124), 5 (2004)","journal-title":"Linux J."},{"key":"7_CR8","volume-title":"HBase: The Definitive Guide: Random Access to Your Planet-size Data","author":"L George","year":"2011","unstructured":"George, L.: HBase: The Definitive Guide: Random Access to Your Planet-size Data. O\u2019Reilly Media Inc., Sebastopol (2011)"},{"key":"7_CR9","unstructured":"Ghemawat, S., Dean, J.: LevelDB (2011). \n                      https:\/\/github.com\/google\/leveldb\n                      \n                    , \n                      http:\/\/leveldb.org"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Lai, C., et al.: Atlas: Baidu\u2019s key-value storage system for cloud data. In: 2015 31st Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201314. IEEE (2015)","DOI":"10.1109\/MSST.2015.7208288"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Li, C., Cox, A.L.: GD-Wheel: a cost-aware replacement policy for key-value stores. In: Proceedings of the Tenth European Conference on Computer Systems, p. 5. ACM (2015)","DOI":"10.1145\/2741948.2741956"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lim, H., Fan, B., Andersen, D.G., Kaminsky, M.: SILT: a memory-efficient, high-performance key-value store. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp. 1\u201313. ACM (2011)","DOI":"10.1145\/2043556.2043558"},{"issue":"1","key":"7_CR13","first-page":"5","volume":"13","author":"L Lu","year":"2017","unstructured":"Lu, L., Pillai, T.S., Gopalakrishnan, H., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: WiscKey: separating keys from values in SSD-conscious storage. ACM Trans. Storage (TOS) 13(1), 5 (2017)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"7_CR14","unstructured":"Marmol, L., et al.: NVMKV: a scalable and lightweight flash aware key-value store. In: HotStorage, p. 8 (2014)"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (LSM-tree). Acta Informatica 33(4), 351\u2013385 (1996)","journal-title":"Acta Informatica"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1007\/s10766-016-0472-z","volume":"45","author":"F Pan","year":"2017","unstructured":"Pan, F., Yue, Y., Xiong, J.: dCompaction: delayed compaction for the LSM-tree. Int. J. Parallel Program. 45(6), 1310\u20131325 (2017)","journal-title":"Int. J. Parallel Program."},{"key":"7_CR17","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, pp. 217\u2013228. ACM (2012)","DOI":"10.1145\/2213836.2213862"},{"key":"7_CR18","unstructured":"Shetty, P., Spillane, R.P., Malpani, R., Andrews, B., Seyster, J., Zadok, E.: Building workload-independent storage with VT-trees. In: Usenix Conference on File and Storage Technologies, pp. 17\u201330 (2013)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Wang, P., et al.: An efficient design and implementation of LSM-tree based key-value store on open-channel SSD. In: Proceedings of the Ninth European Conference on Computer Systems, p. 16. ACM (2014)","DOI":"10.1145\/2592798.2592804"},{"key":"7_CR20","unstructured":"Wu, X., Xu, Y., Shao, Z, Jiang, S.: LSM-trie: an LSM-tree-based ultra-large key-value store for small data. In: Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference, pp. 71\u201382. USENIX Association (2015)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, L., Wang, Y., Ren, Y., Hack, M., Jiang, S.: zExpander: a key-value cache with both high performance and fewer misses. In: Proceedings of the Eleventh European Conference on Computer Systems, p. 14. ACM (2016)","DOI":"10.1145\/2901318.2901332"},{"key":"7_CR22","unstructured":"Yao, T., et al.: A light-weight compaction tree to reduce i\/o amplification toward efficient key-value stores. In: Proceedings of the 33rd International Conference on Massive Storage Systems and Technology (MSST 2017) (2017)"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TPDS.2016.2609912","volume":"28","author":"Y Yue","year":"2017","unstructured":"Yue, Y., He, B., Li, Y., Wang, W.: Building an efficient put-intensive key-value store with skip-tree. IEEE Trans. Parallel Distrib. Syst. 28(4), 961\u2013973 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, Z., et al.: Pipelined compaction for the LSM-tree. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp. 777\u2013786. IEEE (2014)","DOI":"10.1109\/IPDPS.2014.85"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05051-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:17:44Z","timestamp":1558329464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05051-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050504","9783030050511"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05051-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}