{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:54Z","timestamp":1763468094097},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330735"},{"type":"electronic","value":"9783642330742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33074-2_30","type":"book-chapter","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T10:17:22Z","timestamp":1347531442000},"page":"399-412","source":"Crossref","is-referenced-by-count":24,"title":["Adapting the B\u2009+\u2009-tree for Asymmetric I\/O"],"prefix":"10.1007","author":[{"given":"Stratis D.","family":"Viglas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., et al.: Cache-oblivious B-trees. SIAM J. Comput. 35(2) (2005)","DOI":"10.1137\/S0097539701389956"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bonnet, P.: Making CSB+-trees processor conscious. In: DaMoN (2005)","DOI":"10.1145\/1114252.1114259"},{"key":"30_CR3","unstructured":"Borthakur, D.: HDFS architecture guide (2012), http:\/\/hadoop.apache.org\/common\/docs\/current\/hdfs_design.html"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chen, G., et al.: A framework for supporting DBMS-like indexes in the cloud. In: VLDB (2011)","DOI":"10.14778\/3402707.3402711"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Chen, S., et al.: Fractal prefetching B+-trees: optimizing both cache and disk performance. In: SIGMOD (2002)","DOI":"10.1145\/564691.564710"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Computing Surveys\u00a011 (1979)","DOI":"10.1145\/356770.356776"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Write-optimized B-trees. In: VLDB, pp. 672\u2013683 (2004)","DOI":"10.1016\/B978-012088469-8.50060-7"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Graefe, G., Larson, P.-\u00c5.: B-tree indexes and CPU caches. In: ICDE (2001)","DOI":"10.1109\/ICDE.2001.914847"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Hankins, R.A., Patel, J.M.: Effect of node size on the performance of cache-conscious B+-trees. SIGMETRICS Perform. Eval. Rev. 31(1) (2003)","DOI":"10.1145\/885651.781063"},{"key":"30_CR10","unstructured":"Hellerstein, J.M., et al.: Generalized Search Trees for Database Systems. In: VLDB (1995)"},{"key":"30_CR11","unstructured":"J\u00f3nsson, A.M., J\u00f3nsson, B.\u00de.: Towards pB+-trees in the field: Implementation choices and performance. In: EXPDB (2006)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. In: PVLDB, vol.\u00a01(1) (2008)","DOI":"10.14778\/1453856.1453913"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Koltsidas, I., Viglas, S.D.: Data management over flash memory. In: SIGMOD (2011)","DOI":"10.1145\/1989323.1989455"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-23737-9_12","volume-title":"Advances in Databases and Information Systems","author":"I. Koltsidas","year":"2011","unstructured":"Koltsidas, I., Viglas, S.D.: Designing a Flash-Aware Two-Level Cache. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol.\u00a06909, pp. 153\u2013169. Springer, Heidelberg (2011)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Lehman, P.L., Yao, S.B.: Efficient locking for concurrent operations on b-trees. ACM Trans. Database Syst. 6(4) (1981)","DOI":"10.1145\/319628.319663"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: A new dynamic hash index for flash-based storage. In: WAIM. IEEE Computer Society (2008)","DOI":"10.1109\/WAIM.2008.53"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Li, Y., et al.: Tree indexing on flash disks. In: ICDE (2009)","DOI":"10.14711\/thesis-b1054336"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Lomet, D.: The evolution of effective B-tree page organization and techniques: a personal account. SIGMOD Rec.\u00a030(3) (2001)","DOI":"10.1145\/603867.603878"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Nath, S., Kansal, A.: FlashDB: Dynamic self-tuning database for NAND flash. In: IPSN (2007)","DOI":"10.1109\/IPSN.2007.4379701"},{"key":"30_CR20","unstructured":"Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: VLDB (1999)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. SIGMOD Rec. 29(2) (2000)","DOI":"10.1145\/335191.335449"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Viglas, S.D.: Distributed file structures in a peer-to-peer environment. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367886"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Wu, C.H., et al.: An efficient B-tree layer implementation for flash-memory storage systems. Trans. on Embedded Computing Sys. 6(3) (2007)","DOI":"10.1145\/1275986.1275991"},{"key":"30_CR24","unstructured":"Zeinalipour-Yazti, D., et al.: Microhash: an efficient index structure for fash-based sensor devices. In: FAST. USENIX Association (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33074-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:17Z","timestamp":1620129257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33074-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330735","9783642330742"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33074-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}