{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:36:58Z","timestamp":1743043018560,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_15","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"222-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Cache Prefetching for\u00a0LSM-Tree Based Store: From Algorithm to\u00a0Evaluation"],"prefix":"10.1007","author":[{"given":"Shuo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Guangping","family":"Xu","sequence":"additional","affiliation":[]},{"given":"YuLei","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Yanbing","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Wenguang","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"O\u2019Neil, et al.: The log-structured merge-tree (LSM-tree). Acta Inf. 33(4), 351\u2013385 (1996)","key":"15_CR1","DOI":"10.1007\/s002360050048"},{"unstructured":"Jagadish, H.V., et al.: Incremental organization for data recording and warehousing. In: Proceedings of the 23rd VLDB (1997)","key":"15_CR2"},{"unstructured":"Ghemawat, S., Dean, J.: LevelDB. http:\/\/leveldb.org (2011)","key":"15_CR3"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., 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)"},{"unstructured":"Facebook. RocksDB: a persistent key-value store. http:\/\/rocksdb.org","key":"15_CR5"},{"doi-asserted-by":"crossref","unstructured":"Basescu, C., et al.: Robust data sharing with key-value stores. In: Proceedings of DSN (2012)","key":"15_CR6","DOI":"10.1109\/DSN.2012.6263920"},{"issue":"6","key":"15_CR7","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."},{"doi-asserted-by":"crossref","unstructured":"Teng, D., et al.: LSbM-tree: re-enabling buffer caching in data management for mixed reads and writes. In: Proceedings of ICDCS (2017)","key":"15_CR8","DOI":"10.1109\/ICDCS.2017.70"},{"doi-asserted-by":"crossref","unstructured":"Raju, P., et al.: PebblesDB: building key-value stores using fragmented log-structured merge trees. In: Proceedings of SOSP (2017)","key":"15_CR9","DOI":"10.1145\/3132747.3132765"},{"doi-asserted-by":"crossref","unstructured":"Ooper, B.F., et al.: Benchmarking cloud serving systems with YCSB. In: Proceedings of Cloud (2010)","key":"15_CR10","DOI":"10.1145\/1807128.1807152"},{"unstructured":"Wu, X., et al.: LSM-trie: an LSM-tree-based ultra-large key-value store for small data items. In: Proceedings of USENIX ATC (2015)","key":"15_CR11"},{"doi-asserted-by":"crossref","unstructured":"Dayan, N., et al.: Dostoevsky: Better space-time trade-offs for LSM-tree based key-value stores via adaptive removal of superfluous merging. In: Proceedings of SIGMOD (2018)","key":"15_CR12","DOI":"10.1145\/3183713.3196927"},{"unstructured":"Kaiyrakhmet, O., et al.: SLM-DB: single-level key-value store with persistent memory. In: Proceedings of USENIX FAST (2019)","key":"15_CR13"},{"doi-asserted-by":"crossref","unstructured":"Athanassoulis, M., et al. MaSM: efficient online updates in data warehouses. In: Proceedings of SIGMOD (2011)","key":"15_CR14","DOI":"10.1145\/1989323.1989414"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33, 668\u2013676 (1990)","key":"15_CR15","DOI":"10.1145\/78973.78977"},{"issue":"1","key":"15_CR16","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., et al.: dCompaction: speeding up compaction of the LSM-tree via delayed compaction. Comput. Sci. Technol. 32(1), 41\u201354 (2017)","journal-title":"Comput. Sci. Technol."},{"unstructured":"Cockroach Labs. CockroachDB. https:\/\/github.com\/cockroachdb\/cockroach","key":"15_CR17"},{"unstructured":"Apache Cassandra. http:\/\/cassandra.apache.org","key":"15_CR18"},{"key":"15_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-91341-4_2","volume-title":"Evolutionary and swarm intelligence algorithms","author":"JC Bansal","year":"2019","unstructured":"Bansal, J.C.: Particle Swarm Optimization. In: Bansal, J.C., Singh, P.K., Pal, N.R. (eds.) Evolutionary and swarm intelligence algorithms. SCI, vol. 779, pp. 11\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91341-4_2"},{"unstructured":"Cao, Z., et al.: Characterizing, modeling, and benchmarking RocksDB key-value workloads at Facebook. In: Proceedings of USENIX FAST (2020)","key":"15_CR20"},{"unstructured":"Yao, T., Zhang, Y., et al.: MatrixKV: reducing write stalls and write amplification in LSM-tree BasedKV stores with a matrix container in NVM. In: Proceedings of USENIX ATC (2020)","key":"15_CR21"},{"unstructured":"Kannan, S., et al. Redesigning LSMs for nonvolatile memory with NoveL SM. In: Proceedings of USENIX ATC (2018)","key":"15_CR22"},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","volume":"29","author":"C Luo","year":"2019","unstructured":"Luo, C., Carey, M.J.: LSM-based storage techniques: a survey. VLDB J. 29(1), 393\u2013418 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00555-y","journal-title":"VLDB J."},{"unstructured":"Balmau, O., et al. TRIAD: creating synergies between memory, disk and log in log structured key-value stores. In: Proceedings of USENIX ATC (2017)","key":"15_CR24"},{"unstructured":"Wu, L., et al.: Building efficient key-value stores via a lightweight compaction tree. In: Proceedings of USENIX ICDE (2017)","key":"15_CR25"},{"doi-asserted-by":"crossref","unstructured":"Kim, Y., et al. A comparative study of log-structured merge-tree-based spatial indexes for big data. In: Proceedings of USENIX ICDE (2017)","key":"15_CR26","DOI":"10.1109\/ICDE.2017.61"},{"unstructured":"Chen, H., et al.: SpanDB: a fast, cost-effective LSM-tree based KV store on hybrid storage. In: Proceedings of USENIX FAST (2021)","key":"15_CR27"}],"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-3-030-95384-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:23:05Z","timestamp":1645518185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","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":"36% - 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.12","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":"2.27","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}