{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:02:47Z","timestamp":1775638967020,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T00:00:00Z","timestamp":1445990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61379037, 61472376"],"award-info":[{"award-number":["61379037, 61472376"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00778-015-0406-1","type":"journal-article","created":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T07:03:12Z","timestamp":1446015792000},"page":"695-717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Read\/write-optimized tree indexing for solid-state drives"],"prefix":"10.1007","volume":"25","author":[{"given":"Peiquan","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengcheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Puyuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,28]]},"reference":[{"key":"406_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Ganesan, D., Sitaraman, R., Diao, Y., Singh, S.: Lazy-adaptive tree: An optimized index structure for flash devices. In: Proceedings of the VLDB Endowment, vol. 2(1), pp. 361\u2013372 (2009)","DOI":"10.14778\/1687627.1687669"},{"issue":"4","key":"406_CR2","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.2012.20","volume":"62","author":"JS Ahn","year":"2013","unstructured":"Ahn, J.S., Kang, D., Jung, D., Kim, J.S., Maeng, S.: $$\\mu $$ \u03bc *-Tree: an ordered index structure for nand flash memory with adaptive page layout scheme. IEEE Trans. Comput. 62(4), 784\u2013797 (2013)","journal-title":"IEEE Trans. Comput."},{"key":"406_CR3","doi-asserted-by":"crossref","unstructured":"Athanassoulis, M., Ailamaki, A.: BF-Tree: approximate tree indexing. In: Proceedings of the VLDB Endowment vol. 7(14), pp. 1881\u20131892 (2014)","DOI":"10.14778\/2733085.2733094"},{"issue":"1","key":"406_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R Bayer","year":"1977","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of operations on B-trees. Acta inform. 9(1), 1\u201321 (1977)","journal-title":"Acta inform."},{"key":"406_CR5","unstructured":"BenchmarkSQL. http:\/\/sourceforge.net\/projects\/benchmarksql\/"},{"issue":"7","key":"406_CR6","doi-asserted-by":"crossref","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)","journal-title":"Commun. ACM"},{"key":"406_CR7","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting Bloom filters. In: ESA, pp. 684\u2013695 (2006)","DOI":"10.1007\/11841036_61"},{"key":"406_CR8","unstructured":"Canim, M., Mihaila, G.A., Bhattacharjee, B., Lang, C.A., Ross, K.A.: Buffered Bloom filters on solid state storage. In: VLDB Workshop on ADMS, pp. 1\u20138 (2010)"},{"key":"406_CR9","doi-asserted-by":"crossref","unstructured":"Debnath, B., Sengupta, S., Li, J., Lilja, D.J., Du, D.H.C.: BloomFlash: Bloom filter on flash-based storage. In: ICDCS, pp. 635\u2013644 (2011)","DOI":"10.1109\/ICDCS.2011.44"},{"key":"406_CR10","doi-asserted-by":"crossref","unstructured":"Dirik, C., Jacob, B.: The performance of PC solid-state disks (SSDs) as a function of bandwidth, concurrency, device architecture, and system organization. In: ISCA, pp. 279\u2013289 (2009)","DOI":"10.1145\/1555754.1555790"},{"issue":"11","key":"406_CR11","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1109\/TC.2013.158","volume":"63","author":"H Fang","year":"2013","unstructured":"Fang, H., Yeh, M., Suei, P., Kuo, T.: An adaptive endurance-aware B+-Tree for flash memory storage systems. IEEE Trans. Comput. 63(11), 2661\u20132673 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"406_CR12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1806907.1806908","volume":"35","author":"G Graefe","year":"2010","unstructured":"Graefe, G.: A survey of B-tree locking techniques. ACM Trans. Database Syst. 35(3), 16 (2010)","journal-title":"ACM Trans. Database Syst."},{"key":"406_CR13","doi-asserted-by":"crossref","unstructured":"Graefe, G., Halim, F., Idreos, S., Kuno, H., Manegold, S.: Concurrency control for adaptive indexing. In: Proceedings of the VLDB Endowment vol. 5(7), pp. 656\u2013667 (2012)","DOI":"10.14778\/2180912.2180918"},{"issue":"2","key":"406_CR14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00778-013-0345-7","volume":"23","author":"G Graefe","year":"2014","unstructured":"Graefe, G., Halim, F., Idreos, S., Kuno, H., Manegold, S., Seeger, B.: Transactional support for adaptive indexing. VLDB J. 23(2), 303\u2013328 (2014)","journal-title":"VLDB J."},{"issue":"3","key":"406_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2338626.2338630","volume":"37","author":"G Graefe","year":"2012","unstructured":"Graefe, G., Kimura, H., Kuno, H.: Foster B-trees. ACM Trans. Database Syst. 37(3), 17 (2012)","journal-title":"ACM Trans. Database Syst."},{"key":"406_CR16","unstructured":"Hdparm. http:\/\/sourceforge.net\/projects\/hdparm\/"},{"key":"406_CR17","unstructured":"InformationWeek 2014 state of enterprise storage survey. http:\/\/www.seiservice.com\/wp-content\/uploads\/2014\/07\/2014StateofEnterpriseStorage.pdf"},{"issue":"2","key":"406_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00778-004-0140-6","volume":"14","author":"I Jaluta","year":"2005","unstructured":"Jaluta, I., Sippu, S., Soisalon-Soininen, E.: Concurrency control and recovery for balanced B-link trees. VLDB J. 14(2), 257\u2013277 (2005)","journal-title":"VLDB J."},{"key":"406_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.datak.2011.09.007","volume":"72","author":"P Jin","year":"2012","unstructured":"Jin, P., Ou, Y., H\u00e4rder, T., Li, Z.: AD-LRU: an efficient buffer replacement algorithm for flash-based databases. Data Knowl. Eng. 72, 83\u2013102 (2012)","journal-title":"Data Knowl. Eng."},{"issue":"1","key":"406_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10617-013-9123-4","volume":"17","author":"R Jin","year":"2013","unstructured":"Jin, R., Cho, H.J., Lee, S.W., Chung, T.S.: Lazy-split B+-tree: a novel B+-tree index scheme for flash-based database systems. Des. Autom. Embed. Syst. 17(1), 167\u2013191 (2013)","journal-title":"Des. Autom. Embed. Syst."},{"key":"406_CR21","doi-asserted-by":"crossref","unstructured":"Kang, D., Jung, D., Kang, J.U., Kim, J.S.: $$\\mu $$ \u03bc -Tree: an ordered index structure for NAND flash memory. In: EMSOFT, pp. 144\u2013153 (2007)","DOI":"10.1145\/1289927.1289953"},{"key":"406_CR22","unstructured":"Kim, T.: SSD Technology and application trend. http:\/\/www.jedec.org\/sites\/default\/files\/20101004_FlashSummit_Sanjose_TonyKim.pdf"},{"key":"406_CR23","doi-asserted-by":"crossref","unstructured":"Lee, S.W., Moon, B., Park, C.: Advances in flash memory SSD technology for enterprise database applications. In: SIGMOD, pp. 863\u2013870 (2009)","DOI":"10.1145\/1559845.1559937"},{"issue":"4","key":"406_CR24","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"PL Lehman","year":"1981","unstructured":"Lehman, P.L., et al.: Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. 6(4), 650\u2013670 (1981)","journal-title":"ACM Trans. Database Syst."},{"key":"406_CR25","doi-asserted-by":"crossref","unstructured":"Li, Y., He, B., Luo, Q., Yi, K.: Tree indexing on flash disks. In: ICDE, pp. 1303\u20131306 (2009)","DOI":"10.1109\/ICDE.2009.226"},{"key":"406_CR26","doi-asserted-by":"crossref","unstructured":"Li, Y., He, B., Yang, R.J., Luo, Q., Yi, K.: Tree indexing on solid state drives. In: Proceedings of the VLDB Endowment vol. 3(1\u20132), pp. 1195\u20131206 (2010)","DOI":"10.14778\/1920841.1920990"},{"issue":"3","key":"406_CR27","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1109\/TCE.2009.5277999","volume":"55","author":"Z Li","year":"2009","unstructured":"Li, Z., Jin, P., Su, X., Cui, K., Yue, L.: CCF-LRU: a new buffer replacement algorithm for flash memory. IEEE Trans. Consum. Electron. 55(3), 1351\u20131359 (2009)","journal-title":"IEEE Trans. Consum. Electron."},{"issue":"3","key":"406_CR28","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s007780050042","volume":"6","author":"D Lomet","year":"1997","unstructured":"Lomet, D., Salzberg, B.: Concurrency and recovery for index trees. VLDB J. 6(3), 224\u2013240 (1997)","journal-title":"VLDB J."},{"key":"406_CR29","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: MSST, pp. 1\u201311 (2012)","DOI":"10.1109\/MSST.2012.6232390"},{"issue":"1","key":"406_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s11704-013-3013-6","volume":"8","author":"K Lu","year":"2014","unstructured":"Lu, K., Jin, P., Yang, P., Wan, S., Yue, L.: Adaptive in-page logging for flash-memory storage systems. Front. Comput. Sci. 8(1), 131\u2013144 (2014)","journal-title":"Front. Comput. Sci."},{"key":"406_CR31","doi-asserted-by":"crossref","unstructured":"Nath, S., Kansal, A.: FlashDB: Dynamic self-tuning database for NAND flash. In: IPSN, pp. 410\u2013419 (2007)","DOI":"10.1109\/IPSN.2007.4379701"},{"key":"406_CR32","doi-asserted-by":"crossref","unstructured":"Ou, Y., H\u00e4rder, T., Jin, P.: CFDC: a flash-aware replacement policy for database buffer management. In: DAMON, pp. 15\u201320 (2009)","DOI":"10.1145\/1565694.1565698"},{"key":"406_CR33","doi-asserted-by":"crossref","unstructured":"Ouyang, J., Lin, S., Jiang, S., Hou, Z., Wang, Y., Wang, Y.: SDF: Software-defined flash for web-scale internet storage systems. In: ASPLOS, pp. 471\u2013484 (2014)","DOI":"10.1145\/2541940.2541959"},{"issue":"18","key":"406_CR34","doi-asserted-by":"crossref","first-page":"3136","DOI":"10.1016\/j.ins.2009.05.007","volume":"179","author":"H Roh","year":"2009","unstructured":"Roh, H., Kim, W.C., Kim, S., Park, S.: A B-tree index extension to enhance response time and the life cycle of flash memory. Inf. Sci. 179(18), 3136\u20133161 (2009)","journal-title":"Inf. Sci."},{"key":"406_CR35","doi-asserted-by":"crossref","unstructured":"Roh, H., Park, S., Kim, S., Shin, M., Lee, S.W.: B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives. In: Proceedings of the VLDB Endowment vol. 5(4), pp. 286\u2013297 (2011)","DOI":"10.14778\/2095686.2095688"},{"key":"406_CR36","doi-asserted-by":"crossref","unstructured":"Sarwat, M., Mokbel, M.F., Zhou, X., Nath, S.: FAST: a generic framework for flash-aware spatial trees. In: Advances in Spatial and Temporal Databases, pp. 149\u2013167. Springer (2011)","DOI":"10.1007\/978-3-642-22922-0_10"},{"issue":"3","key":"406_CR37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10707-012-0164-9","volume":"17","author":"M Sarwat","year":"2013","unstructured":"Sarwat, M., Mokbel, M.F., Zhou, X., Nath, S.: Generic and efficient framework for search trees on flash memory storage systems. GeoInformatica 17(3), 417\u2013448 (2013)","journal-title":"GeoInformatica"},{"key":"406_CR38","unstructured":"SMHasher & MurmurHash. https:\/\/code.google.com\/p\/smhasher\/"},{"key":"406_CR39","unstructured":"TPC-C. http:\/\/www.tpc.org\/tpcc\/"},{"key":"406_CR40","doi-asserted-by":"crossref","unstructured":"Viglas, S.D.: Adapting the B+-tree for asymmetric I\/O. In: ADBIS, pp. 399\u2013412 (2012)","DOI":"10.1007\/978-3-642-33074-2_30"},{"key":"406_CR41","doi-asserted-by":"crossref","unstructured":"Weikum, G., Vossen, G.: Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Morgan Kaufmann (2002)","DOI":"10.1016\/B978-155860508-4\/50005-3"},{"issue":"3","key":"406_CR42","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1275986.1275991","volume":"6","author":"CH Wu","year":"2007","unstructured":"Wu, C.H., Kuo, T.W., Chang, L.P.: An efficient B-tree layer implementation for flash-memory storage systems. ACM Trans. Embed. Comput. Syst. 6(3), 19 (2007)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"7","key":"406_CR43","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.is.2012.02.002","volume":"37","author":"S Yin","year":"2012","unstructured":"Yin, S., Pucheral, P.: PBFilter: a flash-based indexing scheme for embedded systems. Inf. Syst. 37(7), 634\u2013653 (2012)","journal-title":"Inf. Syst."},{"key":"406_CR44","doi-asserted-by":"crossref","unstructured":"Yin, S., Pucheral, P., Meng, X.: A sequential indexing scheme for flash-based embedded systems. In: EDBT, pp. 588\u2013599 (2009)","DOI":"10.1145\/1516360.1516429"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0406-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0406-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0406-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T22:04:16Z","timestamp":1567289056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0406-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,28]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0406-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,28]]}}}