{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:22:42Z","timestamp":1743121362054,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819772407"},{"type":"electronic","value":"9789819772414"}],"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-7241-4_2","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BIVXDB: A Bottom Information Invert Index to\u00a0Speed up\u00a0the\u00a0Query Performance of\u00a0LSM-Tree"],"prefix":"10.1007","author":[{"given":"Zekun","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixin","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinliang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"issue":"7","key":"2_CR1","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/362686.362692","journal-title":"Commun. ACM"},{"key":"2_CR2","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, p.\u00a0143. ACM Press, Indianapolis (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"2_CR3","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"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TNET.2006.872576","volume":"14","author":"S Dharmapurikar","year":"2006","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest prefix matching using bloom filters. IEEE\/ACM Trans. Network. 14(2), 397\u2013409 (2006). https:\/\/doi.org\/10.1109\/TNET.2006.872576","journal-title":"IEEE\/ACM Trans. Network."},{"key":"2_CR5","unstructured":"Facebook: Rocksdb documentation. https:\/\/rocksdb.org.cn\/ doc .html"},{"key":"2_CR6","unstructured":"Facebook: Rocksdb tuning guide. https:\/\/github.com\/facebook\/rocksdb\/wiki\/RocksDB-Tuning-Guide"},{"key":"2_CR7","unstructured":"Google: Leveldb documentation. https:\/\/github.com\/google\/leveldb\/ blob\/master\/doc\/index.md"},{"key":"2_CR8","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":"2_CR9","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":"2_CR10","unstructured":"Kaiyrakhmet, O., Lee, S., Nam, B., Noh, S.H., Choi, Y.R.: SLM-DB: single-level key-value store with persistent memory. In: 17th USENIX Conference on File and Storage Technologies (FAST 2019), pp. 191\u2013205. USENIX Association, Boston (2019). https:\/\/www.usenix.org\/conference\/fast19\/presentation\/kaiyrakhmet"},{"key":"2_CR11","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":"2_CR12","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 Association, pp. 739\u2013752 (2019)"},{"key":"2_CR13","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","DOI":"10.1109\/TPDS.2021.3118599"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Luo, S., Chatterjee, S., Ketsetsidis, R., Dayan, N., Qin, W., Idreos, S., Rosetta: a robust space-time optimized range filter for key-value stores. In: Association Computing Machinery, pp. 2071\u20132086 (2020). https:\/\/doi.org\/10.1145\/3318464.3389731","DOI":"10.1145\/3318464.3389731"},{"issue":"4","key":"2_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"},{"key":"2_CR16","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":"2_CR17","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":"2_CR18","unstructured":"Wu, F., Yang, M., Zhang, B., Du, D.: AC-key: adaptive caching for LSM-based key-value stores. In: USENIX Association, pp. 603\u2013615 (2020)"},{"key":"2_CR19","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":"2_CR20","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":"2_CR21","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":"2_CR22","unstructured":"Zhong, W., Chen, C., Wu, X., Jiang, S.: REMIX: efficient range query for LSM-trees. In: USENIX Association, pp. 51\u201364 (2021)"}],"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-7241-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:17:33Z","timestamp":1724775453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7241-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772407","9789819772414"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7241-4_2","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 August 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":"Jinhua","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}