{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:27:37Z","timestamp":1742920057125,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031416729"},{"type":"electronic","value":"9783031416736"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-41673-6_9","type":"book-chapter","created":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T16:03:31Z","timestamp":1692029011000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel-Batched Interpolation Search Tree"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[]},{"given":"Ilya","family":"Kokorin","sequence":"additional","affiliation":[]},{"given":"Alena","family":"Martsenyuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,15]]},"reference":[{"key":"9_CR1","unstructured":"Acar, U.A., Blelloch, G.E.: Algorithms: Parallel and sequential. https:\/\/www.umut-acar.org\/algorithms-book 6 (2019)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Akhremtsev, Y., Sanders, P.: Fast parallel operations on search trees. In: 2016 IEEE 23rd International Conference on High Performance Computing (HiPC), pp. 291\u2013300. IEEE (2016)","DOI":"10.1109\/HiPC.2016.042"},{"key":"9_CR3","unstructured":"Aksenov, V., Kokorin, I., Martsenyuk, A.: Parallel-batched interpolation search tree. arXiv preprint (2023). arXiv:2306.13785"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bentley, J.L., Yao, A.C.C.: An almost optimal algorithm for unbounded searching. Inform. Process. Lett. 5(3), 82\u201387(SLAC-PUB-1679) (1976)","DOI":"10.1016\/0020-0190(76)90071-5"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Ferizovic, D., Sun, Y.: Just join for parallel ordered sets. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 253\u2013264 (2016)","DOI":"10.1145\/2935764.2935768"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Reid-Miller, M.: Fast set operations using treaps. In: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms And Architectures, pp. 16\u201326 (1998)","DOI":"10.1145\/277651.277660"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/jpdc.1996.0107","volume":"37","author":"RD Blumofe","year":"1996","unstructured":"Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: an efficient multithreaded runtime system. J. Parallel Distrib. Comput. 37(1), 55\u201369 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Brown, T., Prokopec, A., Alistarh, D.: Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 276\u2013291 (2020)","DOI":"10.1145\/3332466.3374542"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous b-tree. ACM Comput. Surv. (CSUR) 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Graefe, G., et al.: Modern b-tree techniques. Foundations and Trends\u00ae in Databases 3(4), 203\u2013402 (2011)","DOI":"10.1561\/1900000028"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pp. 8\u201321. IEEE (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"9_CR12","volume":"10","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An introduction to parallel algorithms. Reading, MA: Addison-Wesley 10, 133889 (1992)","journal-title":"Reading, MA: Addison-Wesley"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, pp. 489\u2013504 (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Lea, D.: A java fork\/join framework. In: Proceedings of the ACM 2000 Conference on Java Grande, pp. 36\u201343 (2000)","DOI":"10.1145\/337449.337465"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jpdc.1998.1432","volume":"49","author":"M Medidi","year":"1998","unstructured":"Medidi, M., Deo, N.: Parallel dictionaries using AVL trees. J. Parallel Distrib. Comput. 49(1), 146\u2013155 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/174130.174139","volume":"40","author":"K Mehlhorn","year":"1993","unstructured":"Mehlhorn, K., Tsakalidis, A.: Dynamic interpolation search. J. ACM (JACM) 40(3), 621\u2013634 (1993)","journal-title":"J. ACM (JACM)"},{"issue":"1\u20132","key":"9_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0304-3975(00)00287-5","volume":"262","author":"H Park","year":"2001","unstructured":"Park, H., Park, K.: Parallel algorithms for red-black trees. Theoret. Comput. Sci. 262(1\u20132), 415\u2013435 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BFb0036940","volume-title":"Automata, Languages and Programming","author":"W. Paul","year":"1983","unstructured":"Paul, W.., Vishkin, U.., Wagener, H..: Parallel dictionaries on 2\u20133 trees. In: Diaz, Josep (ed.) ICALP 1983. LNCS, vol. 154, pp. 597\u2013609. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036940"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1147\/rd.12.0130","volume":"1","author":"WW Peterson","year":"1957","unstructured":"Peterson, W.W.: Addressing for random-access storage. IBM J. Res. Dev. 1(2), 130\u2013146 (1957)","journal-title":"IBM J. Res. Dev."},{"key":"9_CR20","unstructured":"Prokopec, A., Brown, T., Alistarh, D.: Analysis and evaluation of non-blocking interpolation search trees. arXiv preprint arXiv:2001.00413 (2020)"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM (JACM) 32(3), 652\u2013686 (1985)","journal-title":"J. ACM (JACM)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Sun, Y., Ferizovic, D., Belloch, G.E.: Pam: parallel augmented maps. In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 290\u2013304 (2018)","DOI":"10.1145\/3178487.3178509"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0214071","volume":"14","author":"DE Willard","year":"1985","unstructured":"Willard, D.E.: Searching unindexed and nonuniformly generated files in $$\\backslash $$log$$\\backslash $$logn time. SIAM J. Comput. 14(4), 1013\u20131029 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41673-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T20:08:46Z","timestamp":1692043726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41673-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031416729","9783031416736"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41673-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PaCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Computing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Astana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazakhstan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pact2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ssd.sscc.ru\/conference\/pact2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}