{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:10:04Z","timestamp":1750795804536,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644707"},{"type":"electronic","value":"9783319644714"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64471-4_15","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T10:37:25Z","timestamp":1501583845000},"page":"172-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Concurrency Control Protocol that Selects Accessible Replicated Pages to Avoid Latch Collisions for B-Trees in Manycore Environments"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"Yoshihara","sequence":"first","affiliation":[]},{"given":"Haruo","family":"Yokota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"unstructured":"Intel 64 and ia-32 architectures optimization reference manual. http:\/\/www.intel.com\/content\/dam\/doc\/manual\/64-ia-32-architectures-optimization-manual.pdf","key":"15_CR1"},{"unstructured":"Intel 64 and ia-32 architectures software developers manual. http:\/\/download.intel.com\/design\/processor\/manuals\/253668.pdf","key":"15_CR2"},{"unstructured":"Apache: Hadoop. http:\/\/hadoop.apache.org\/","key":"15_CR3"},{"unstructured":"Cha, S.K., Hwang, S., Kim, K., Kwon, K.: Cache-conscious concurrency control of main-memory indexes on shared-memory multiprocessor systems. In: Proceedings of VLDB 2001, pp. 181\u2013190 (2001)","key":"15_CR4"},{"doi-asserted-by":"crossref","unstructured":"Graefe, G.: Write-optimized B-trees. In: Proceedings of VLDB 2004, pp. 672\u2013683 (2004)","key":"15_CR5","DOI":"10.1016\/B978-012088469-8.50060-7"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2338626.2338630","volume":"37","author":"G Graefe","year":"2012","unstructured":"Graefe, G., Kimura, H., Kuno, H.A.: Foster b-trees. ACM Trans. Database Syst. 37(3), 17 (2012)","journal-title":"ACM Trans. Database Syst."},{"key":"15_CR7","volume-title":"Transaction Processing: Concepts and Techniques","author":"J Gray","year":"1992","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo (1992)"},{"key":"15_CR8","volume-title":"Intel Xeon Phi Coprocessor High Performance Programming","author":"J Jeffers","year":"2013","unstructured":"Jeffers, J., Reinders, J.: Intel Xeon Phi Coprocessor High Performance Programming, 1st edn. Morgan Kaufmann, San Francisco (2013)","edition":"1"},{"key":"15_CR9","volume-title":"Intel Xeon Phi Processor High Performance Programming","author":"J Jeffers","year":"2016","unstructured":"Jeffers, J., Reinders, J., Sodani, A.: Intel Xeon Phi Processor High Performance Programming, 2nd edn. Morgan Kaufmann, San Francisco (2016)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Johnson, T., Shasha, D.: Utilization of B-trees with inserts, deletes and modifies. In: Proceedings of PODS 1989, pp. 235\u2013246 (1989)","key":"15_CR10","DOI":"10.1145\/73721.73745"},{"doi-asserted-by":"crossref","unstructured":"Jung, H., Han, H., Fekete, A.D., Heiser, G., Yeom, H.Y.: A scalable lock manager for multicores. In: Proceedings of ACM SIGMOD 2013, pp. 73\u201384 (2013)","key":"15_CR11","DOI":"10.1145\/2463676.2465271"},{"doi-asserted-by":"crossref","unstructured":"Karnagel, T., Dementiev, R., Rajwar, R., Lai, K., Legler, T., Schlegel, B., Lehner, W.: Improving in-memory database index performance with intel$$^{\\textregistered }$$ transactional synchronization extensions. In: Proceedings of HPCA 2014, pp. 476\u2013487 (2014)","key":"15_CR12","DOI":"10.1109\/HPCA.2014.6835957"},{"doi-asserted-by":"crossref","unstructured":"Kimura, H.: FOEDUS: OLTP engine for a thousand cores and NVRAM. In: Proceedings of ACM SIGMOD 2015, pp. 691\u2013706 (2015)","key":"15_CR13","DOI":"10.1145\/2723372.2746480"},{"doi-asserted-by":"crossref","unstructured":"Kissinger, T., Schlegel, B., Habich, D., Lehner, W.: KISS-Tree: smart latch-free in-memory indexing on modern architectures. In: Proceedings of DaMoN 2012, pp. 16\u201323 (2012)","key":"15_CR14","DOI":"10.1145\/2236584.2236587"},{"doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: Exploiting hardware transactional memory in main-memory databases. In: Proceedings of ICDE 2014, pp. 580\u2013591 (2014)","key":"15_CR15","DOI":"10.1109\/ICDE.2014.6816683"},{"doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Lomet, D.B., Sengupta, S.: The bw-tree: a b-tree for new hardware platforms. In: Proceedings of ICDE 2013, pp. 302\u2013313 (2013)","key":"15_CR16","DOI":"10.1109\/ICDE.2013.6544834"},{"unstructured":"Love, R.: Linux J. 2003(111), 8 (2003)","key":"15_CR17"},{"doi-asserted-by":"crossref","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of EuroSys 2012, pp. 183\u2013196 (2012)","key":"15_CR18","DOI":"10.1145\/2168836.2168855"},{"issue":"10","key":"15_CR19","first-page":"610","volume":"4","author":"I Pandis","year":"2011","unstructured":"Pandis, I., T\u00f6z\u00fcn, P., Johnson, R., Ailamaki, A.: PLP: page latch-free shared-everything OLTP. PVLDB 4(10), 610\u2013621 (2011)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Porobic, D., Liarou, E., T\u00f6z\u00fcn, P., Ailamaki, A.: Atrapos: adaptive transaction processing on hardware islands. In: Proceedings of ICDE 2014, pp. 688\u2013699 (2014)","key":"15_CR20","DOI":"10.1109\/ICDE.2014.6816692"},{"issue":"11","key":"15_CR21","first-page":"795","volume":"4","author":"J Sewall","year":"2011","unstructured":"Sewall, J., Chhugani, J., Kim, C., Satish, N., Dubey, P.: PALM: parallel architecture-friendly latch-free modifications to B+ trees on many-core processors. PVLDB 4(11), 795\u2013806 (2011)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Tu, S., Zheng, W., Kohler, E., Liskov, B., Madden, S.: Speedy transactions in multicore in-memory databases. In: Proceedings of ACM SIGOPS 2013, pp. 18\u201332 (2013)","key":"15_CR22","DOI":"10.1145\/2517349.2522713"},{"doi-asserted-by":"crossref","unstructured":"Yokota, H., Kanemasa, Y., Miyazaki, J.: Fat-Btree: an update-conscious parallel directory structure. In: Proceedings of ICDE 1999, pp. 448\u2013457 (1999)","key":"15_CR23","DOI":"10.1109\/ICDE.1999.754961"},{"doi-asserted-by":"crossref","unstructured":"Yoshihara, T., Dai, K., Yokota, H.: A concurrency control protocol for parallel b-tree structures without latch-coupling for explosively growing digital content. In: Proceedings of EDBT 2008, pp. 133\u2013144 (2008)","key":"15_CR24","DOI":"10.1145\/1353343.1353363"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64471-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:35:23Z","timestamp":1750793723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-64471-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644707","9783319644714"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64471-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"2 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}