{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:12Z","timestamp":1750220772782,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,7]]},"DOI":"10.1145\/3400903.3401691","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T21:20:29Z","timestamp":1596144029000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combining Two Worlds: MonetDB with Multi-Dimensional Index Structure Support to Efficiently Query Scientific Data"],"prefix":"10.1145","author":[{"given":"Paul","family":"Blockhaus","sequence":"first","affiliation":[{"name":"University of Magdeburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Broneske","sequence":"additional","affiliation":[{"name":"University of Magdeburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Sch\u00e4ler","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veit","family":"K\u00f6ppen","sequence":"additional","affiliation":[{"name":"University of Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunter","family":"Saake","sequence":"additional","affiliation":[{"name":"University of Magdeburg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ELKI: A Software System for Evaluation of Subspace Clustering Algorithms. In SSDBM. 580\u2013585. https:\/\/doi.org\/10.1007\/978-3-540-69497-7_41","author":"Achtert Elke","year":"2008","unstructured":"Elke Achtert , Hans-Peter Kriegel , and Arthur Zimek . 2008 . ELKI: A Software System for Evaluation of Subspace Clustering Algorithms. In SSDBM. 580\u2013585. https:\/\/doi.org\/10.1007\/978-3-540-69497-7_41 10.1007\/978-3-540-69497-7_41 Elke Achtert, Hans-Peter Kriegel, and Arthur Zimek. 2008. ELKI: A Software System for Evaluation of Subspace Clustering Algorithms. In SSDBM. 580\u2013585. https:\/\/doi.org\/10.1007\/978-3-540-69497-7_41"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Stefan Berchtold Christian B\u00f6hm and Hans-Peter Kriegel. 1998. The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In SIGMOD. 142\u2013153.  Stefan Berchtold Christian B\u00f6hm and Hans-Peter Kriegel. 1998. The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In SIGMOD. 142\u2013153.","DOI":"10.1145\/276305.276318"},{"volume-title":"Elf Meets MonetDB: Integrating a Multi-Column Structure Into a Column Store. Master\u2019s thesis","author":"Bethe Florian","key":"e_1_3_2_1_3_1","unstructured":"Florian Bethe . 2018. Elf Meets MonetDB: Integrating a Multi-Column Structure Into a Column Store. Master\u2019s thesis . University of Magdeburg. http :\/\/wwwiti.cs.uni-magdeburg.de\/iti_db\/publikationen\/ps\/auto\/thesisBethe18.pdf Master Thesis. Florian Bethe. 2018. Elf Meets MonetDB: Integrating a Multi-Column Structure Into a Column Store. Master\u2019s thesis. University of Magdeburg. http:\/\/wwwiti.cs.uni-magdeburg.de\/iti_db\/publikationen\/ps\/auto\/thesisBethe18.pdf Master Thesis."},{"key":"e_1_3_2_1_4_1","unstructured":"Peter\u00a0A. Boncz Marcin Zukowski and Niels Nes. 2005. MonetDB\/X100: Hyper-Pipelining Query Execution. In CIDR. ACM 225\u2013237.  Peter\u00a0A. Boncz Marcin Zukowski and Niels Nes. 2005. MonetDB\/X100: Hyper-Pipelining Query Execution. In CIDR. ACM 225\u2013237."},{"volume-title":"Accelerating Multi-Column Selection Predicates in Main-Memory - The Elf Approach","author":"Broneske David","key":"e_1_3_2_1_5_1","unstructured":"David Broneske , Veit K\u00f6ppen , 2017. Accelerating Multi-Column Selection Predicates in Main-Memory - The Elf Approach . In ICDE. IEEE , 647\u2013658. David Broneske, Veit K\u00f6ppen, 2017. Accelerating Multi-Column Selection Predicates in Main-Memory - The Elf Approach. In ICDE. IEEE, 647\u2013658."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2825349"},{"volume-title":"Fundamentals of Database Systems(7 ed.)","author":"Elmasri Ramez","key":"e_1_3_2_1_7_1","unstructured":"Ramez Elmasri and Shamkant\u00a0 B. Navathe . 2015. Fundamentals of Database Systems(7 ed.) . Addison-Wesley . Ramez Elmasri and Shamkant\u00a0B. Navathe. 2015. Fundamentals of Database Systems(7 ed.). Addison-Wesley."},{"volume-title":"B-Tree Indexes and CPU Caches","author":"Graefe Goetz","key":"e_1_3_2_1_8_1","unstructured":"Goetz Graefe and P-A Larson . 2001. B-Tree Indexes and CPU Caches . In ICDE. IEEE , 349\u2013358. Goetz Graefe and P-A Larson. 2001. B-Tree Indexes and CPU Caches. In ICDE. IEEE, 349\u2013358."},{"volume-title":"R-Trees: A Dynamic Index Structure for Spatial Searching","author":"Guttman Antonin","key":"e_1_3_2_1_9_1","unstructured":"Antonin Guttman . 1984. R-Trees: A Dynamic Index Structure for Spatial Searching . In SIGMOD. Association for Computing Machinery , 47\u201357. https:\/\/doi.org\/10.1145\/602259.602266 10.1145\/602259.602266 Antonin Guttman. 1984. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD. Association for Computing Machinery, 47\u201357. https:\/\/doi.org\/10.1145\/602259.602266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"A. Kemper and T. Neumann. 2011. HyPer: A Hybrid OLTP & OLAP Main Memory Database System Based on Virtual Memory Snapshots. In ICDE. IEEE 195\u2013206.  A. Kemper and T. Neumann. 2011. HyPer: A Hybrid OLTP & OLAP Main Memory Database System Based on Virtual Memory Snapshots. In ICDE. IEEE 195\u2013206.","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_3_2_1_11_1","first-page":"2209","article-title":"Everything You Always Wanted to Know About Compiled and Vectorized Queries but Were Afraid to Ask","volume":"11","author":"Kersten Timo","year":"2018","unstructured":"Timo Kersten , Viktor Leis , 2018 . Everything You Always Wanted to Know About Compiled and Vectorized Queries but Were Afraid to Ask . PVLDB 11 , 13 (2018), 2209 \u2013 2222 . https:\/\/doi.org\/10.14778\/3275366.3284966 10.14778\/3275366.3284966 Timo Kersten, Viktor Leis, 2018. Everything You Always Wanted to Know About Compiled and Vectorized Queries but Were Afraid to Ask. PVLDB 11, 13 (2018), 2209\u20132222. https:\/\/doi.org\/10.14778\/3275366.3284966","journal-title":"PVLDB"},{"volume-title":"The Adaptive Radix Tree: ARTful Indexing for Main-memory Databases","author":"Leis Viktor","key":"e_1_3_2_1_12_1","unstructured":"Viktor Leis , Alfons Kemper , and Thomas Neumann . 2013. The Adaptive Radix Tree: ARTful Indexing for Main-memory Databases . In ICDE. IEEE , 38\u201349. Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The Adaptive Radix Tree: ARTful Indexing for Main-memory Databases. In ICDE. IEEE, 38\u201349."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Jun Rao and Kenneth\u00a0A. Ross. 2000. Making B+-Trees Cache Conscious in Main Memory. In SIGMOD Record Vol.\u00a029. ACM 475\u2013486.  Jun Rao and Kenneth\u00a0A. Ross. 2000. Making B+-Trees Cache Conscious in Main Memory. In SIGMOD Record Vol.\u00a029. ACM 475\u2013486.","DOI":"10.1145\/335191.335449"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556551"},{"volume-title":"Multidimensional Range Queries on Modern Hardware","author":"Sprenger Stefan","key":"e_1_3_2_1_15_1","unstructured":"Stefan Sprenger , Patrick Sch\u00e4fer , and Ulf Leser . 2018. Multidimensional Range Queries on Modern Hardware . In SSDBM. Association for Computing Machinery , New York, NY, USA , 12. https:\/\/doi.org\/10.1145\/3221269.3223031 10.1145\/3221269.3223031 Stefan Sprenger, Patrick Sch\u00e4fer, and Ulf Leser. 2018. Multidimensional Range Queries on Modern Hardware. In SSDBM. Association for Computing Machinery, New York, NY, USA, 12. https:\/\/doi.org\/10.1145\/3221269.3223031"},{"key":"#cr-split#-e_1_3_2_1_16_1.1","doi-asserted-by":"crossref","unstructured":"Stefan Sprenger Patrick Sch\u00e4fer and Ulf Leser. 2019. BB-Tree: A Main-Memory Index Structure for Multidimensional Range Queries. In ICDE. 1566-1569. https:\/\/doi.org\/10.1109\/ICDE.2019.00143 10.1109\/ICDE.2019.00143","DOI":"10.1109\/ICDE.2019.00143"},{"key":"#cr-split#-e_1_3_2_1_16_1.2","doi-asserted-by":"crossref","unstructured":"Stefan Sprenger Patrick Sch\u00e4fer and Ulf Leser. 2019. BB-Tree: A Main-Memory Index Structure for Multidimensional Range Queries. In ICDE. 1566-1569. https:\/\/doi.org\/10.1109\/ICDE.2019.00143","DOI":"10.1109\/ICDE.2019.00143"},{"key":"#cr-split#-e_1_3_2_1_17_1.1","unstructured":"Stefan Sprenger Patrick Sch\u00e4fer and Ulf Leser. 2019. BB-Tree: A practical and efficient main-memory index structure for multidimensional workloads. In EDBT. 169-180. https:\/\/doi.org\/10.5441\/002\/edbt.2019.16 10.5441\/002"},{"key":"#cr-split#-e_1_3_2_1_17_1.2","doi-asserted-by":"crossref","unstructured":"Stefan Sprenger Patrick Sch\u00e4fer and Ulf Leser. 2019. BB-Tree: A practical and efficient main-memory index structure for multidimensional workloads. In EDBT. 169-180. https:\/\/doi.org\/10.5441\/002\/edbt.2019.16","DOI":"10.1109\/ICDE.2019.00143"},{"key":"e_1_3_2_1_18_1","unstructured":"Mike Stonebraker Daniel\u00a0J. Abadi 2005. C-Store: A Column-Oriented DBMS. In VLDB. VLDB Endowment 553\u2013564. http:\/\/dl.acm.org\/citation.cfm?id=1083592.1083658  Mike Stonebraker Daniel\u00a0J. Abadi 2005. C-Store: A Column-Oriented DBMS. In VLDB. VLDB Endowment 553\u2013564. http:\/\/dl.acm.org\/citation.cfm?id=1083592.1083658"},{"key":"e_1_3_2_1_19_1","unstructured":"Transaction Processing Performance Council. 2014. TPC BENCHMARK H (Decision Support). Technical Report 2.17.1.  Transaction Processing Performance Council. 2014. TPC BENCHMARK H (Decision Support). Technical Report 2.17.1."},{"key":"#cr-split#-e_1_3_2_1_20_1.1","doi-asserted-by":"crossref","unstructured":"David\u00a0A. White and Ramesh\u00a0C. Jain. 1996. Similarity Indexing with the SS-Tree. In ICDE. 516-523. https:\/\/doi.org\/10.1109\/ICDE.1996.492202 10.1109\/ICDE.1996.492202","DOI":"10.1109\/ICDE.1996.492202"},{"key":"#cr-split#-e_1_3_2_1_20_1.2","doi-asserted-by":"crossref","unstructured":"David\u00a0A. White and Ramesh\u00a0C. Jain. 1996. Similarity Indexing with the SS-Tree. In ICDE. 516-523. https:\/\/doi.org\/10.1109\/ICDE.1996.492202","DOI":"10.1109\/ICDE.1996.492202"},{"key":"e_1_3_2_1_21_1","unstructured":"Thomas Willhalm Ismail Oukid 2013. Vectorizing Database Column Scans with Complex Predicates. In ADMS. 1\u201312.  Thomas Willhalm Ismail Oukid 2013. Vectorizing Database Column Scans with Complex Predicates. In ADMS. 1\u201312."}],"event":{"name":"SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management","acronym":"SSDBM 2020","location":"Vienna Austria"},"container-title":["32nd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3401691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400903.3401691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:18Z","timestamp":1750200078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3401691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,7]]},"references-count":24,"alternative-id":["10.1145\/3400903.3401691","10.1145\/3400903"],"URL":"https:\/\/doi.org\/10.1145\/3400903.3401691","relation":{},"subject":[],"published":{"date-parts":[[2020,7,7]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}