{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:49:56Z","timestamp":1725551396619},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120978"},{"type":"electronic","value":"9783642120985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12098-5_22","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T14:44:49Z","timestamp":1270651489000},"page":"276-290","source":"Crossref","is-referenced-by-count":0,"title":["Update Migration: An Efficient B+ Tree for Flash Storage"],"prefix":"10.1007","author":[{"given":"Chang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidan","family":"Shou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianlei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1413254.1413261","volume":"6","author":"J. Gray","year":"2008","unstructured":"Gray, J., Fitzgerald, B.: Flash disk opportunity for sever applications. ACM Queue\u00a06(4), 18\u201323 (2008)","journal-title":"ACM Queue"},{"issue":"4-5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1147\/rd.524.0529","volume":"52","author":"S.K. Lai","year":"2008","unstructured":"Lai, S.K.: Flash memories: Successes and challenges. IBM Journal of Research and Developmen\u00a052(4-5), 529\u2013535 (2008)","journal-title":"IBM Journal of Research and Developmen"},{"doi-asserted-by":"crossref","unstructured":"Lee, S.W., Moon, B.: Design of flash-based dbms: an in-page logging approach. In: SIGMOD Conference, pp. 55\u201366 (2007)","key":"22_CR3","DOI":"10.1145\/1247480.1247488"},{"unstructured":"Bouganim, L., J\u00f3nsson, B.T., Bonnet, P.: uFLIP: Understanding Flash IO Patterns. In: CIDR (2009)","key":"22_CR4"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-540-24686-2_26","volume-title":"Real-Time and Embedded Computing Systems and Applications","author":"C.-H. Wu","year":"2004","unstructured":"Wu, C.-H., Chang, L.-P., Kuo, T.-W.: An Efficient B-Tree Layer for Flash-Memory Storage Systems. In: Chen, J., Hong, S. (eds.) RTCSA 2003. LNCS, vol.\u00a02968, pp. 409\u2013430. Springer, Heidelberg (2004)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-72685-2_18","volume-title":"Embedded Software and Systems","author":"H.-S. Lee","year":"2007","unstructured":"Lee, H.-S., Park, S., Song, H.-J., Lee, D.-H.: An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash memory. In: Lee, Y.-H., Kim, H.-N., Kim, J., Park, Y.W., Yang, L.T., Kim, S.W. (eds.) ICESS 2007. LNCS, vol.\u00a04523, pp. 181\u2013192. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Xiang, X., Yue, L., Liu, Z., Wei, P.: A reliable B-tree implementation over flash memory. In: SAC, pp. 1487\u20131491 (2008)","key":"22_CR7","DOI":"10.1145\/1363686.1364036"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., He, B., Luo, Q., Yi, K.: Tree Indexing on Flash Disks. In: ICDE, pp. 1303\u20131306 (2009)","key":"22_CR8","DOI":"10.1109\/ICDE.2009.226"},{"doi-asserted-by":"crossref","unstructured":"Na, G.-J., Moon, B., Lee, S.-W.: In-Page Logging B-Tree for Flash Memory. In: DASFAA, pp. 755\u2013758 (2009)","key":"22_CR9","DOI":"10.1007\/978-3-642-00887-0_66"},{"issue":"1","key":"22_CR10","first-page":"361","volume":"2","author":"D. Agrawal","year":"2009","unstructured":"Agrawal, D., Ganesan, D., Sitaraman, R., Diao, Y., Singh, S.: Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices. PVLDB\u00a02(1), 361\u2013372 (2009)","journal-title":"PVLDB"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P.E. O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P.E., Cheng, E., Gawlick, D., O\u2019Neil, E.J.: The Log-Structured Merge-Tree (LSM-Tree). Acta Inf.\u00a033(4), 351\u2013385 (1996)","journal-title":"Acta Inf."},{"unstructured":"Mohan, C.: Concurrency Control and Recovery Methods for B+-Tree Indexes: ARIES\/KVL and ARIES\/IM. In: Performance of Concurrency Control Mechanisms in Centralized Database Systems, pp. 248\u2013306 (1996)","key":"22_CR12"},{"doi-asserted-by":"crossref","unstructured":"Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and Recovery in Generalized Search Trees. In: SIGMOD Conference, pp. 67\u201372 (1997)","key":"22_CR13","DOI":"10.1145\/253260.253272"},{"doi-asserted-by":"crossref","unstructured":"Mohan, C., Levine, F.E.: ARIES\/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. In: SIGMOD Conference, pp. 371\u2013380 (1992)","key":"22_CR14","DOI":"10.1145\/130283.130338"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/128765.128770","volume":"17","author":"C. Mohan","year":"1992","unstructured":"Mohan, C., Haderle, D.J., Lindsay, B.G., Pirahesh, H., Schwarz, P.M.: ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst.\u00a017(1), 94\u2013162 (1992)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P. Lehman","year":"1981","unstructured":"Lehman, P., Yao, S.: Efficient locking for concurrent operationson B-trees. ACM Trans Database Sys.\u00a06(4), 650\u2013670 (1981)","journal-title":"ACM Trans Database Sys."},{"unstructured":"Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J.D., Manasse, M.S., Panigrahy, R.: Design Tradeoffs for SSD Performance. In: USENIX Annual Technical Conference, pp. 57\u201370 (2008)","key":"22_CR17"},{"doi-asserted-by":"crossref","unstructured":"Sagiv, Y.: Concurrent Operations on B-Trees with Overtaking. In: PODS, pp. 28\u201337 (1985)","key":"22_CR18","DOI":"10.1145\/325405.325409"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12098-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:02:49Z","timestamp":1619784169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12098-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120978","9783642120985"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12098-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}