{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:35:05Z","timestamp":1743132905691,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723867"},{"type":"electronic","value":"9789819723874"}],"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-2387-4_27","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:02:02Z","timestamp":1714240922000},"page":"402-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TrieKV: Managing Values After KV Separation to\u00a0Optimize Scan Performance in\u00a0LSM-Tree"],"prefix":"10.1007","author":[{"given":"Zekun","family":"Yao","sequence":"first","affiliation":[]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Yinliang","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Jinzhou","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"27_CR1","unstructured":"Pebblesdb: Building key-value stores using fragmented log-structured merge trees. In: The 26th Symposium, pp. 497\u2013514 (2017)"},{"key":"27_CR2","unstructured":"Triad: Creating synergies between memory, disk and log in log structured key-value stores. In: Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (2017)"},{"key":"27_CR3","unstructured":"Chan, H.H.W., Li, Y., Lee, P.P.C., Xu, Y.: HashKV: enabling efficient updates in KV storage via hashing. In: Proceedings of the 2018 USENIX Conference on Usenix Annual Technical Conference, p.\u00a014 (2018)"},{"key":"27_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 - SoCC 2010, Indianapolis, Indiana, USA, p.\u00a0143. ACM Press (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"27_CR5","unstructured":"Dai, Y., et al.: USENIX Assoc: From WiscKey to Bourbon: A Learned Index for Log-Structured Merge Trees, pp. 155\u2013171 (2020)"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Optimal bloom filters and adaptive merging for LSM-trees. ACM Trans. Database Syst. 43(4) (2018). https:\/\/doi.org\/10.1145\/3276980","DOI":"10.1145\/3276980"},{"key":"27_CR7","unstructured":"Facebook: Rocksdb documentation. https:\/\/rocksdb.org.cn\/doc.html"},{"key":"27_CR8","unstructured":"Google: Leveldb documentation. https:\/\/github.com\/google\/leveldb\/blob\/master\/doc\/index.md"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Hu, X.Y., Eleftheriou, E., Haas, R., Iliadis, I., Pletka, R.: Write amplification analysis in flash-based solid state drives. In: Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference on - SYSTOR 2009, Haifa, Israel, p.\u00a01. ACM Press (2009)","DOI":"10.1145\/1534530.1534544"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Huang, C., Hu, H., Wei, X., Qian, W., Zhou, A.: Partition pruning for range query on distributed log-structured merge-tree. Front. Comput. Sci. 14(3) (2020). https:\/\/doi.org\/10.1007\/s11704-019-8234-x","DOI":"10.1007\/s11704-019-8234-x"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Im, J., Bae, J., Chung, C., Arvind, Lee, S.: Design of LSM-tree-based Key-value SSDs with Bounded Tails. ACM Trans. Storage 17(2) (2021). https:\/\/doi.org\/10.1145\/3452846","DOI":"10.1145\/3452846"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Li, C., Chen, H., Ruan, C., Ma, X., Xu, Y.: Leveraging NVME SSDS for building a fast, cost-effective, LSM-tree-based KV store. ACM Trans. Storage 17(4) (2021). https:\/\/doi.org\/10.1145\/3480963","DOI":"10.1145\/3480963"},{"key":"27_CR13","unstructured":"Li, Y., Tian, C., Guo, F., Li, C., Xu, Y., USENIX Assoc: ElasticBF: elastic bloom filter with hotness awareness for boosting read performance in large key-value stores, pp. 739\u2013752 (2019)"},{"key":"27_CR14","unstructured":"Li, Y., et al.: Differentiated Key-Value storage management for balanced I\/O performance. In: 2021 USENIX Annual Technical Conference (USENIX ATC 21), pp. 673\u2013687. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/atc21\/presentation\/li-yongkun"},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Lu, K., Zhao, N., Wan, J., Fei, C., Zhao, W., Deng, T.: TridentKV: a read-optimized LSM-tree based KV Store via adaptive indexing and space-efficient partitioning. IEEE Trans. Parallel Distrib. Syst. 33(8), 1953\u20131966 (2022). https:\/\/doi.org\/10.1109\/TPDS.2021.3118599, https:\/\/ieeexplore.ieee.org\/document\/9563237\/","DOI":"10.1109\/TPDS.2021.3118599"},{"issue":"1","key":"27_CR16","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)"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/TPDS.2019.2950248","volume":"31","author":"Z Lu","year":"2020","unstructured":"Lu, Z., Cao, Q., Mei, F., Jiang, H., Li, J.: A novel multi-stage forest-based key-value store for holistic performance improvement. IEEE Trans. Parallel Distrib. Syst. 31(4), 856\u2013870 (2020). https:\/\/doi.org\/10.1109\/TPDS.2019.2950248","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"27_CR18","doi-asserted-by":"publisher","unstructured":"Luo, S., et al.: A robust space-time optimized range filter for key-value stores, pp. 2071\u20132086 (2020).https:\/\/doi.org\/10.1145\/3318464.3389731","DOI":"10.1145\/3318464.3389731"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Ouaknine, K., Agra, O., Guz, Z.: Optimization of RocksDB for Redis on Flash. In: Proceedings of the International Conference on Compute and Data Analysis - ICCDA 2017, Lakeland, FL, USA, pp. 155\u2013161. ACM Press (2017)","DOI":"10.1145\/3093241.3093278"},{"issue":"4","key":"27_CR20","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":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11390-017-1704-4","volume":"32","author":"FF Pan","year":"2017","unstructured":"Pan, F.F., Yue, Y.L., Xiong, J.: dcompaction: speeding up compaction of the LSM-tree via delayed compaction. J. Comput. Sci. Technol. 32(1), 41\u201354 (2017)","journal-title":"J. Comput. Sci. Technol."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. In: Workshop on Algorithms & Data Structures (1990)","DOI":"10.1007\/3-540-51542-9_36"},{"key":"27_CR23","doi-asserted-by":"publisher","unstructured":"Ren, K., Zheng, Q., Arulraj, J., Gibson, G.: Slimdb: a space-efficient key-value storage engine for semi-sorted data. Proc. VLDB Endow. 10(13), 2037\u20132048 (2017). https:\/\/doi.org\/10.14778\/3151106.3151108","DOI":"10.14778\/3151106.3151108"},{"key":"27_CR24","doi-asserted-by":"publisher","unstructured":"Sun, X., Yu, J., Zhou, Z., Xue, C.J.: FPGA-based compaction engine for accelerating LSM-tree key-value stores. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1261\u20131272 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00113","DOI":"10.1109\/ICDE48307.2020.00113"},{"key":"27_CR25","unstructured":"Yao, T., et al.: Matrixkv: reducing write stalls and write amplification in LSM-tree based KV stores with matrix container in NVM. In: The 2020 USENIX Annual Technical Conference, pp. 17\u201331 (2020)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-05677-3_6","volume-title":"Network and Parallel Computing","author":"H Wang","year":"2018","unstructured":"Wang, H., Yue, Y., He, S., Wang, W.: KT-store: a key-order and write-order hybrid key-value store with high write and range-query performance. In: Zhang, F., Zhai, J., Snir, M., Jin, H., Kasahara, H., Valero, M. (eds.) NPC 2018. LNCS, vol. 11276, pp. 64\u201376. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05677-3_6"},{"key":"27_CR27","doi-asserted-by":"publisher","unstructured":"Wang, Y., Jin, P., Wan, S.: HotKey-LSM: a hotness-aware LSM-tree for big data storage, pp. 5849\u20135851 (2020). https:\/\/doi.org\/10.1109\/BigData50022.1010.9377736","DOI":"10.1109\/BigData50022.1010.9377736"},{"key":"27_CR28","unstructured":"Wu, F., Yang, M., Zhang, B., Du, D., USENIX Assoc: AC-key: adaptive caching for LSM-based key-value stores, pp. 603\u2013615 (2020)"},{"key":"27_CR29","doi-asserted-by":"publisher","unstructured":"Yao, T., Wan, J., Huang, P., He, X., Wu, F., Xie, C.: Building efficient key-value stores via a lightweight compaction tree. ACM Trans. Storage 13(4) (2017). https:\/\/doi.org\/10.1145\/3139922","DOI":"10.1145\/3139922"},{"key":"27_CR30","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TPDS.2016.2609912","volume":"23","author":"Y Yue","year":"2017","unstructured":"Yue, Y., Wang, W., Li, Y., He, B.: Building an efficient put-intensive key-value store with skip-tree. IEEE Trans. Parallel Distrib. Syst. 23, 961\u2013973 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"27_CR31","doi-asserted-by":"publisher","unstructured":"Zhang, B., Du, D.H.C.: NVLSM: a persistent memory key-value store using log-structured merge tree with accumulative compaction. ACM Trans. Storage 17(3) (2021). https:\/\/doi.org\/10.1145\/3453300","DOI":"10.1145\/3453300"},{"key":"27_CR32","doi-asserted-by":"publisher","unstructured":"Zhang, H., et al.: Succinct range filters. ACM Trans. Database Syst. 45(2) (2020). https:\/\/doi.org\/10.1145\/3375660","DOI":"10.1145\/3375660"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, Y., Lee, P.P.C., 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), Dallas, TX, USA, pp. 313\u2013324. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00034"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2387-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:09:15Z","timestamp":1714241355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2387-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723867","9789819723874"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2387-4_27","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":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"6 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.apweb-waim2023.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}