{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:22:53Z","timestamp":1743067373907,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708109"},{"type":"electronic","value":"9789819708116"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0811-6_12","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T17:02:24Z","timestamp":1708966944000},"page":"202-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MDCF: Multiple Dynamic Cuckoo Filters for\u00a0LSM-Tree"],"prefix":"10.1007","author":[{"given":"Xingfei","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taotao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoyan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"12_CR1","unstructured":"Apache: Cassandra. https:\/\/cassandra.apache.org"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Armstrong, T.G., Ponnekanti, V., Borthakur, D., Callaghan, M.: LinkBench: a database benchmark based on the Facebook social graph. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 1185\u20131196 (2013)","DOI":"10.1145\/2463676.2465296"},{"key":"12_CR3","unstructured":"Balmau, O., et al.: TRIAD: creating synergies between memory, disk and log in log structured key-value stores. In: 2017 USENIX Annual Technical Conference (USENIX ATC 2017), pp. 363\u2013375 (2017)"},{"key":"12_CR4","unstructured":"Chan, H.H., Li, Y., Lee, P.P., Xu, Y.: HashKV: enabling efficient updates in KV storage via hashing. In: 2018 USENIX Annual Technical Conference (USENIX ATC 2018), pp. 1007\u20131019 (2018)"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., et al.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. (TOCS) 26(2), 1\u201326 (2008)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H., Liao, L., Jin, H., Wu, J.: The dynamic cuckoo filter. In: 2017 IEEE 25th International Conference on Network Protocols (ICNP), pp. 1\u201310. IEEE (2017)","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"12_CR7","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 (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Monkey: optimal navigable key-value store. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 79\u201394 (2017)","DOI":"10.1145\/3035918.3064054"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Dayan, N., Twitto, M.: Chucky: a succinct Cuckoo filter for LSM-tree. In: Proceedings of the 2021 International Conference on Management of Data, pp. 365\u2013378 (2021)","DOI":"10.1145\/3448016.3457273"},{"issue":"1\u20132","key":"12_CR10","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 Endowment 3(1\u20132), 1414\u20131425 (2010)","journal-title":"Proc. VLDB Endowment"},{"key":"12_CR11","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 (2011)","DOI":"10.1145\/1989323.1989327"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"G DeCandia","year":"2007","unstructured":"DeCandia, G., et al.: Dynamo: Amazon\u2019s highly available key-value store. ACM SIGOPS Oper. Syst. Rev. 41(6), 205\u2013220 (2007)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"12_CR13","unstructured":"Facebook: RocksDB. https:\/\/rocksdb.org\/"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than Bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirt, P., Huber, M., Mulazzani, M., Weippl, E.R.: InnoDB database forensics. In: 2010 24th IEEE International Conference on Advanced Information Networking and Applications, pp. 1028\u20131036. IEEE (2010)","DOI":"10.1109\/AINA.2010.152"},{"key":"12_CR16","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":"12_CR17","unstructured":"Li, Y., Tian, C., Guo, F., Li, C., Xu, Y.: ElasticBF: elastic bloom filter with hotness awareness for boosting read performance in large key-value stores. In: USENIX Annual Technical Conference, pp. 739\u2013752 (2019)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Lu, G., Nam, Y.J., Du, D.H.: BloomStore: bloom-filter based memory-efficient key-value store for indexing of data deduplication on flash. In: 2012 IEEE 28th Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201311. IEEE (2012)","DOI":"10.1109\/MSST.2012.6232390"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3033273","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), 1\u201328 (2017)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"12_CR20","unstructured":"Papagiannis, A., Saloustros, G., Gonz\u00e1lez-F\u00e9rez, P., Bilas, A.: Tucana: design and implementation of a fast and efficient scale-up key-value store. In: 2016 USENIX Annual Technical Conference (USENIX ATC 2016), pp. 537\u2013550 (2016)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Raju, P., Kadekodi, R., Chidambaram, V., Abraham, I.: PebblesDB: building key-value stores using fragmented log-structured merge trees. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 497\u2013514 (2017)","DOI":"10.1145\/3132747.3132765"},{"issue":"13","key":"12_CR22","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.14778\/3151106.3151108","volume":"10","author":"K Ren","year":"2017","unstructured":"Ren, K., Zheng, Q., Arulraj, J., Gibson, G.: SlimDB: a space-efficient key-value storage engine for semi-sorted data. Proc. VLDB Endowment 10(13), 2037\u20132048 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"12_CR23","unstructured":"Sanjay Ghemawat, J.D.: LevelDB. https:\/\/github.com\/google\/leveldb"},{"key":"12_CR24","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 (2012)","DOI":"10.1145\/2213836.2213862"},{"key":"12_CR25","unstructured":"Shetty, P.J., Spillane, R.P., Malpani, R.R., Andrews, B., Seyster, J., Zadok, E.: Building workload-independent storage with VT-trees. In: Presented as Part of the 11th USENIX Conference on File and Storage Technologies (FAST 2013), pp. 17\u201330 (2013)"},{"key":"12_CR26","unstructured":"Sumbaly, R., Kreps, J., Gao, L., Feinberg, A., Soman, C., Shah, S.: Serving large-scale batch computed data with project Voldemort. In: FAST, vol. 12, pp. 18\u201318 (2012)"},{"key":"12_CR27","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, pp. 1\u201314 (2014)","DOI":"10.1145\/2592798.2592804"},{"key":"12_CR28","unstructured":"Lee, Y., Ren, J.: RocksDB. https:\/\/github.com\/ls4154\/YCSB-cpp"},{"key":"12_CR29","unstructured":"Yao, T., et al.: GearDB: a GC-free key-value store on HM-SMR drives with gear compaction. In: 19th USENIX Conference on File and Storage Technologies (FAST) (2019)"},{"key":"12_CR30","unstructured":"Yao, T., et al.: MatrixKV: reducing write stalls and write amplification in LSM-tree based KV stores with a matrix container in NVM. In: Proceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference, pp. 17\u201331 (2020)"},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TPDS.2016.2609912","volume":"28","author":"Y Yue","year":"2016","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 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, Y., Lee, P.P., Xu, Y., Cui, Q., Tang, L.: UniKV: toward high-performance and scalable KV storage in mixed workloads via unified indexing. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 313\u2013324. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00034"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0811-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T17:04:00Z","timestamp":1708967040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0811-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708109","9789819708116"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0811-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","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":"Tianjin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","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 (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}