{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:02:27Z","timestamp":1751860947659,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319999869"},{"type":"electronic","value":"9783319999876"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99987-6_8","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T05:57:05Z","timestamp":1535608625000},"page":"105-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SIMD Acceleration for Main-Memory Index Structures \u2013 A Survey"],"prefix":"10.1007","author":[{"given":"Marten","family":"Wallewein-Eising","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Broneske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunter","family":"Saake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: Proceedings of the Annual Symposium on Foundations of Computer Science, pp. 399\u2013409. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892128"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string B-trees. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 233\u2013242. ACM (2006)","DOI":"10.1145\/1142351.1142385"},{"key":"8_CR3","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-58274-0_19","volume-title":"Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation","author":"A Borodin","year":"2017","unstructured":"Borodin, A., Mirvoda, S., Kulikov, I., Porshnev, S.: Optimization of memory operations in generalized search trees of PostgreSQL. In: Kozielski, S., Mrozek, D., Kasprowski, P., Ma\u0142ysiak-Mrozek, B., Kostrzewa, D. (eds.) BDAS 2017. CCIS, vol. 716, pp. 224\u2013232. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58274-0_19"},{"key":"8_CR4","unstructured":"Broneske, D., Bre\u00df, S., Heimel, M., Saake, G.: Toward hardware-sensitive database operations. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 229\u2013234 (2014)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-13960-9_8","volume-title":"In Memory Data Management and Analysis","author":"D Broneske","year":"2015","unstructured":"Broneske, D., Bre\u00df, S., Saake, G.: Database scan variants on modern CPUs: a performance study. In: Jagatheesan, A., Levandoski, J., Neumann, T., Pavlo, A. (eds.) IMDM 2013-2014. LNCS, vol. 8921, pp. 97\u2013111. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13960-9_8"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Broneske, D., K\u00f6ppen, V., Saake, G., Sch\u00e4ler, M.: Accelerating multi-column selection predicates in main-memory - the Elf approach. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 647\u2013658. IEEE (2017)","DOI":"10.1109\/ICDE.2017.118"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1515\/itit-2016-0049","volume":"59","author":"D Broneske","year":"2017","unstructured":"Broneske, D., Saake, G.: Exploiting capabilities of modern processors in data intensive applications. IT - Inf. Technol. 59(3), 133\u2013140 (2017). https:\/\/doi.org\/10.1515\/itit-2016-0049","journal-title":"IT - Inf. Technol."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Graefe, G., Larson, P.A.: B-tree indexes and CPU caches. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 349\u2013358. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914847"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Kim, C., et al.: FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 339\u2013350. ACM (2010)","DOI":"10.1145\/1807167.1807206"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 38\u201349. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Polychroniou, O., Raghavan, A., Ross, K.A.: Rethinking SIMD vectorization for in-memory databases. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 1493\u20131508. ACM (2015)","DOI":"10.1145\/2723372.2747645"},{"key":"8_CR12","unstructured":"Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: Proceedings of the International Conference on Very Large Databases (VLDB), vol. 99, pp. 78\u201389 (1999)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: ACM SIGMOD Record, vol. 29, pp. 475\u2013486. ACM (2000)","DOI":"10.1145\/335191.335449"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: K-ary search on modern processors. In: Proceedings of the International Workshop on Data Management on New Hardware (DaMoN), pp. 52\u201360. ACM (2009)","DOI":"10.1145\/1565694.1565705"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Suaib, M., Palaty, A., Pandey, K.S.: Architecture of SIMD type vector processor. Int. J. Comput. Appl. 20(4) (2011)","DOI":"10.5120\/2418-3233"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Yamamuro, T., Onizuka, M., Hitaka, T., Yamamuro, M.: VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 396\u2013407. ACM (2012)","DOI":"10.1145\/2247596.2247643"},{"key":"8_CR17","unstructured":"Zeuch, S., Huber, F., Freytag, J.: Adapting tree structures for processing with SIMD instructions. In: Proceedings of the International Conference on Extending Database Technology (EDBT). Citeseer (2014)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Zukowski, M., Heman, S., Nes, N., Boncz, P.: Super-scalar RAM-CPU cache compression. In: Proceedings of the International Conference on Data Engineering (ICDE), p. 59. IEEE (2006)","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures and Structures. Facing the Challenges of Data Proliferation and Growing Variety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99987-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T17:50:47Z","timestamp":1751824247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99987-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999869","9783319999876"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99987-6_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference: Beyond Databases, Architectures and Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pozna\u0144","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bdas2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bdas.polsl.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}