{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:54:23Z","timestamp":1780401263091,"version":"3.54.1"},"reference-count":292,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,31]]},"abstract":"<jats:p>Key-value data structures constitute the core of any data-driven system. They provide the means to store, search, and modify data residing at various levels of the storage and memory hierarchy, from durable storage (spinning disks, solid state disks, and other non-volatile memories) to random access memory, caches, and registers. Designing efficient data structures for given workloads has long been a focus of research and practice in both academia and industry.<\/jats:p>\n                  <jats:p>This book outlines the underlying design dimensions of data structures and shows how they can be combined to support (or fail to support) various workloads. The book further shows how these design dimensions can lead to an understanding of the behavior of individual state-of-the-art data structures and their hybrids. Finally, this systematization of the design space and the accompanying guidelines will enable you to select the most fitting data structure or even to invent an entirely new data structure for a given workload.<\/jats:p>","DOI":"10.1561\/1900000059","type":"journal-article","created":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T07:25:07Z","timestamp":1691393107000},"page":"1-168","source":"Crossref","is-referenced-by-count":5,"title":["Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines"],"prefix":"10.1108","volume":"13","author":[{"given":"Manos","family":"Athanassoulis","sequence":"first","affiliation":[{"name":"Boston University ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stratos","family":"Idreos","sequence":"additional","affiliation":[{"name":"Harvard University ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[{"name":"New York University ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2023,7,31]]},"reference":[{"issue":"3","key":"2026033109421009200_ref001","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1561\/1900000024","article-title":"The Design and Implementation of Modern Column-Oriented Database Systems","volume":"5","author":"Abadi","year":"2013","journal-title":"Foundations and Trends in Databases"},{"key":"2026033109421009200_ref002","first-page":"466","article-title":"Materialization Strategies in a Column-Oriented DBMS","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Abadi","year":"2007"},{"key":"2026033109421009200_ref003","article-title":"Learned Indexes for a Google-scale Disk-based Database","volume-title":"Proceedings of the Workshop on ML for Systems at NeurIPS","author":"Abu-Libdeh","year":"2020"},{"key":"2026033109421009200_ref004","first-page":"263","article-title":"An algorithm for the organization of information","volume-title":"Proceedings of the USSR Academy of Sciences","author":"Adelson-Velsky","year":"1962"},{"issue":"9","key":"2026033109421009200_ref005","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The Input\/Output Complexity of Sorting and Related Problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Communications of the ACM"},{"key":"2026033109421009200_ref006","first-page":"169","article-title":"Weaving Relations for Cache Performance","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)","author":"Ailamaki","year":"2001"},{"key":"2026033109421009200_ref007","first-page":"266","article-title":"DBMSs on a modern processor: Where does time go?","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)","author":"Ailamaki","year":"1999"},{"key":"2026033109421009200_ref008","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/ICDE.2O15.7113419","article-title":"How to stop under-utilization and love multicores","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Ailamaki","year":"2014"},{"key":"2026033109421009200_ref009","doi-asserted-by":"publisher","DOI":"10.2200\/S00774ED1V01Y2017 04DTM045","volume-title":"Synthesis Lectures on Data Management","author":"Ailamaki","year":"2017"},{"issue":"3","key":"2026033109421009200_ref010","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/s00778-002-0074-9","article-title":"Data Page Layouts for Relational Databases on Deep Memory Hierarchies","volume":"11","author":"Ailamaki","year":"2002","journal-title":"The VLDB Journal"},{"key":"2026033109421009200_ref011","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1145\/2588555.2610502","article-title":"H2O: A Hands-free Adaptive Store","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Alagiannis","year":"2014"},{"key":"2026033109421009200_ref012","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.14778\/2733085.2733096","article-title":"AsterixDB: A Scalable, Open Source BDMS","volume-title":"Proceedings of the VLDB Endowment","author":"Alsubaiee","year":"2014"},{"key":"2026033109421009200_ref013","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1629575.1629577","article-title":"FAWN: A Fast Array of Wimpy Nodes","volume-title":"Proceedings of the ACM Symposium on Operating Systems Principles (SOSP)","author":"Andersen","year":"2009"},{"key":"2026033109421009200_ref014","first-page":"476","article-title":"Byte-aligned Bitmap Compression","volume-title":"Proceedings of the Conference on Data Compression (DCC)","author":"Antoshenkov","year":"1995"},{"key":"2026033109421009200_ref015","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/2882903.2915231","article-title":"Bridging the Archipelago between Row-Stores and Column-Stores for Hybrid Workloads","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Arulraj","year":"2016"},{"key":"2026033109421009200_ref016","first-page":"519","article-title":"The DataPath System: A Data-centric Analytic Processing Engine for Large Data Warehouses","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Arumugam","year":"2010"},{"key":"2026033109421009200_ref017","unstructured":"Athanassoulis, M.\n           (2014). \u201cSolid-State Storage and Work Sharing for Efficient Scaleup Data Analytics\u201d. PhD thesis. EPFL. doi:http:\/\/dx.doi.org\/10.5075\/epfl-thesis-6032."},{"key":"2026033109421009200_ref018","first-page":"1881","article-title":"BF-Tree: Approximate Tree Indexing","volume-title":"Proceedings of the VLDB Endowment","author":"Athanassoulis","year":"2014"},{"issue":"4","key":"2026033109421009200_ref019","first-page":"28","article-title":"Flash in a DBMS: Where and How?","volume":"33","author":"Athanassoulis","year":"2010","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"1","key":"2026033109421009200_ref020","article-title":"Online Updates on Data Warehouses via Judicious Use of Solid-State Storage","volume":"40","author":"Athanassoulis","year":"2015","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref021","article-title":"Design Tradeoffs of Data Access Methods","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data, Tutorial","author":"Athanassoulis","year":"2016"},{"key":"2026033109421009200_ref022","first-page":"461","article-title":"Designing Access Methods: The RUM Conjecture","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT)","author":"Athanassoulis","year":"2016"},{"key":"2026033109421009200_ref023","first-page":"21","article-title":"Building Deletion-Compliant Data Systems","volume-title":"IEEE Data Engineering Bulletin","author":"Athanassoulis","year":"2022"},{"key":"2026033109421009200_ref024","unstructured":"Badam, A., K.Park, V. S.Pai, and L. L.Peterson. (2009). \u201cHashCache: Cache Storage for the Next Billion\u201d. In: Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI). 123\u2013136. url:http:\/\/dl.acm.org\/citation.cfm?id=1558977.1558986"},{"issue":"1","key":"2026033109421009200_ref025","first-page":"9","article-title":"Business Analytics in (a) Blink","volume":"35","author":"Barber","year":"2012","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref026","article-title":"In-Memory BLU Acceleration in IBM\u2019s DB2 and dashDB: Optimized for Modern Workloads and Hardware Architectures","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Barber","year":"2015"},{"key":"2026033109421009200_ref027","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","article-title":"Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Informatica"},{"key":"2026033109421009200_ref028","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00288683","article-title":"Organization and Maintenance of Large Ordered Indices","volume-title":"Proceedings of the ACM SIGFIDET Workshop on Data Description and Access","author":"Bayer","year":"1970"},{"key":"2026033109421009200_ref029","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and Maintenance of Large Ordered Indices","volume-title":"Acta Informatica","author":"Bayer","year":"1972"},{"key":"2026033109421009200_ref030","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","article-title":"An Asymptotically Optimal Multiversion B-Tree","volume-title":"The VLDB Journal","author":"Becker","year":"1996"},{"key":"2026033109421009200_ref031","unstructured":"Bender, M. A., M.Farach-Colton, W.Jannen, R.Johnson, B. C.Kuszmaul, D. E.Porter, J.Yuan, and Y.Zhan. (2015). \u201cAn Introduction to B\u2208-trees and Write-Optimization\u201d. White Paper. URL: http:\/\/supertech.csail.mit.edu\/papers\/BenderFaJa15.pdf."},{"issue":"11","key":"2026033109421009200_ref032","first-page":"1627","article-title":"Don\u2019t Thrash: How to Cache Your Hash on Flash","volume":"5","author":"Bender","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"5","key":"2026033109421009200_ref033","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable Searching Problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Information Processing Letters"},{"issue":"4","key":"2026033109421009200_ref034","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable Searching Problems I: Static-to-Dynamic Transformation","volume":"1","author":"Bentley","year":"1980","journal-title":"Journal of Algorithms"},{"issue":"3","key":"2026033109421009200_ref035","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","article-title":"An Almost Optimal Algorithm for Unbounded Searching","volume":"5","author":"Bentley","year":"1976","journal-title":"Information Processing Letters"},{"key":"2026033109421009200_ref036","volume-title":"Concurrency Control and Recovery in Database Systems","author":"Bernstein","year":"1987"},{"key":"2026033109421009200_ref037","unstructured":"Bhat, W. A.\n           (2018). \u201cBridging data-capacity gap in big data storage\u201d. Future Generation Computer Systems. doi:https:\/\/doi.org\/10.1016\/j.future.2017.12.066."},{"issue":"7","key":"2026033109421009200_ref038","first-page":"422","article-title":"Space\/Time Trade-offs in Hash Coding with Allowable Errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Communications of the ACM"},{"issue":"12","key":"2026033109421009200_ref039","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1409360.1409380","article-title":"Breaking the Memory Wall in MonetDB","volume":"51","author":"Boncz","year":"2008","journal-title":"Communications of the ACM"},{"key":"2026033109421009200_ref040","first-page":"54","article-title":"Database architecture optimized for the new bottleneck: Memory access","author":"Boncz","year":"1999","journal-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)"},{"key":"2026033109421009200_ref041","article-title":"MonetDB\/X100: Hyper-Pipelining Query Execution","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Boncz","year":"2005"},{"key":"2026033109421009200_ref042","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/ICDE.2015.7113294","article-title":"Smooth Scan: Statistics-Oblivious Access Paths","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Borovica-Gajic","year":"2015"},{"key":"2026033109421009200_ref043","volume-title":"Understanding the Linux Kernel","author":"Bovet","year":"2005","edition":"3"},{"issue":"9","key":"2026033109421009200_ref044","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.14778\/3213880.3213884","article-title":"Morton Filters: Faster, Space Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity","volume":"11","author":"Breslow","year":"2018","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref045","unstructured":"Brodal, G. S. and R.Fagerberg. (2003). \u201cLower Bounds for External Memory Dictionaries\u201d. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 546\u2013554. url:http:\/\/dl.acm.org\/citation.cfm?id=644108.644201%20http:\/\/www.cs.au.dk\/~gerth\/papers\/alcomft-tr-03-75.pdf."},{"issue":"1","key":"2026033109421009200_ref046","first-page":"277","article-title":"A scalable, predictable join operator for highly concurrent data warehouses","volume":"2","author":"Candea","year":"2009","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"2026033109421009200_ref047","first-page":"227","article-title":"Predictable Performance and High Query Concurrency for Data Analytics","volume":"20","author":"Candea","year":"2011","journal-title":"The VLDB Journal"},{"key":"2026033109421009200_ref048","unstructured":"Chan, C. Y., B. C.Ooi, and H.Lu. (1992). \u201cExtensible Buffer Management of Indexes\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 444\u2013454. url:http:\/\/www.vldb.org\/conf\/1992\/P444.PDF."},{"issue":"2","key":"2026033109421009200_ref049","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/2 76305.276336","article-title":"Bitmap index design and evaluation","volume":"27","author":"Chan","year":"1998","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"2026033109421009200_ref050","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/304181.304201","article-title":"An efficient bitmap encoding scheme for selection queries","volume":"28","author":"Chan","year":"1999","journal-title":"ACM SIGMOD Record"},{"key":"2026033109421009200_ref051","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/3183713.3196898","article-title":"FASTER: A Concurrent KeyValue Store with In-Place Updates","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Chandramouli","year":"2018"},{"key":"2026033109421009200_ref052","unstructured":"Chang, F., J.Dean, S.Ghemawat, W. C.Hsieh, D. A.Wallach, M.Burrows, T.Chandra, A.Fikes, and R. E.Gruber. (2006). \u201cBigtable: A Distributed Storage System for Structured Data\u201d. In: Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI). 205\u2013218. URL: http:\/\/dl.acm.org\/citation.cfm?id=1267308.1267323."},{"key":"2026033109421009200_ref053","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485461","article-title":"Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine","volume-title":"In Proceedings of the Very Large Databases Endowment","author":"Chatterjee","year":"2022"},{"key":"2026033109421009200_ref054","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0015734","article-title":"Fractional Cascading: A Data Structuring Technique with Geometric Applications","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP)","author":"Chazelle","year":"1985"},{"key":"2026033109421009200_ref055","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-0-387-39940-9{\\_}133","volume-title":"Encyclopedia of Database Systems","author":"Chen","year":"2009"},{"key":"2026033109421009200_ref056","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/375663.375688","article-title":"Improving Index Performance through Prefetching","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Chen","year":"2001"},{"key":"2026033109421009200_ref057","unstructured":"Chen, S., P. B.Gibbons, T. C.Mowry, and G.Valentin. (2002). \u201cFractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance\u201d. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 157\u2013168. URL: http:\/\/dl.acm.org\/citation.cfm?id=564691.564710."},{"key":"2026033109421009200_ref058","unstructured":"Chen, S., P. B.Gibbons, and S.Nath. (2011). \u201cRethinking Database Algorithms for Phase Change Memory\u201d. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)."},{"issue":"16","key":"2026033109421009200_ref059","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ipl.2010.05.018","article-title":"Concise: Compressed \u2018N\u2019 Composable Integer Set","volume":"110","author":"Colantonio","year":"2010","journal-title":"Information Processing Letters"},{"issue":"2","key":"2026033109421009200_ref060","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The Ubiquitous B-Tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Computing Surveys"},{"key":"2026033109421009200_ref061","unstructured":"Copeland, G. P. and S.Khoshafian. (1985). \u201cA Decomposition Storage Model\u201d. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 268\u2013279. URL: http:\/\/dl.acm.org\/citation.cfm?id=318898.318923."},{"key":"2026033109421009200_ref062","volume-title":"Introduction to Algorithm 3rd Edition","author":"Cormen","year":"2009"},{"key":"2026033109421009200_ref063","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/3035918.3064054","article-title":"Monkey: Optimal Navigable Key-Value Store","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Dayan","year":"2017"},{"issue":"4","key":"2026033109421009200_ref064","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3276980","article-title":"Optimal Bloom Filters and Adaptive Merging for LSM-Trees","volume":"43","author":"Dayan","year":"2018","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref065","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/3183713.3196927","article-title":"Dostoevsky: Better Space-Time TradeOffs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Dayan","year":"2018"},{"key":"2026033109421009200_ref066","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/3299869.3319903","article-title":"The Log-Structured Merge-Bush & the Wacky Continuum","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD)","author":"Dayan","year":"2019"},{"issue":"12","key":"2026033109421009200_ref067","first-page":"2932","article-title":"The End of Moore\u2019s Law and the Rise of The Data Processor","volume":"14","author":"Dayan","year":"2021","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1\u20132","key":"2026033109421009200_ref068","first-page":"1414","article-title":"FlashStore: high throughput persistent key-value store","volume":"3","author":"Debnath","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref069","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1989323.1989327","article-title":"SkimpyStash: RAM space skimpy key-value store on flash-based storage","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Debnath","year":"2011"},{"issue":"4","key":"2026033109421009200_ref070","doi-asserted-by":"publisher","first-page":"600","DOI":"10.14778\/3436905.3436919","article-title":"Stacked Filters: Learning to Filter by Structure","volume":"14","author":"Deeds","year":"2020","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref071","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/1739041.1739071","article-title":"Position list word aligned hybrid: optimizing space and performance for compressed bitmaps","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT)","author":"Deli\u00e8ge","year":"2010"},{"key":"2026033109421009200_ref072","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1145\/3318464.3389769","article-title":"Bitvector-aware Query Optimization for Decision Support Queries","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Ding","year":"2020"},{"key":"2026033109421009200_ref073","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1145\/3448016.3457270","article-title":"Instance-Optimized Data Layouts for Cloud Analytics Workloads","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Ding","year":"2021"},{"key":"2026033109421009200_ref074","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1145\/3318464.3389711","article-title":"ALEX: An Updatable Adaptive Learned Index","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Ding","year":"2020"},{"key":"2026033109421009200_ref075","unstructured":"Dittrich, J. and A.Jindal. (2011). \u201cTowards a One Size Fits All Database Architecture\u201d. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR). 195\u2013198. url:http:\/\/cidrdb.org\/cidr2011\/Papers\/CIDR11_Paper25.pdf."},{"key":"2026033109421009200_ref076","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/582353.582375","article-title":"Applying Approximate Order Dependency to Reduce Indexing Space","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Dong","year":"1982"},{"key":"2026033109421009200_ref077","unstructured":"Dong, S., M.Callaghan, L.Galanis, D.Borthakur, T.Savor, and M.Strum. (2017). \u201cOptimizing Space Amplification in RocksDB\u201d. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR). url:http:\/\/cidrdb.org\/cidr2017\/papers\/p82-dong-cidr17.pdf."},{"issue":"4","key":"2026033109421009200_ref078","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/3483840","article-title":"RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications","volume":"17","author":"Dong","year":"2021","journal-title":"ACM Transactions on Storage (TOS)"},{"issue":"1","key":"2026033109421009200_ref079","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1900000 058","article-title":"Main Memory Database Systems","volume":"8","author":"Faerber","year":"2017","journal-title":"Foundations and Trends in Databases"},{"issue":"5","key":"2026033109421009200_ref080","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1147\/rd.174.0324","article-title":"The Design of APL","volume":"17","author":"Falkoff","year":"1973","journal-title":"IBM Journal of Research and Development"},{"key":"2026033109421009200_ref081","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2674005.2674994","article-title":"Cuckoo Filter: Practically Better Than Bloom","volume-title":"Proceedings of the ACM International on Conference on emerging Networking Experiments and Technologies (CoNEXT)","author":"Fan","year":"2014"},{"issue":"1","key":"2026033109421009200_ref082","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00778-019-00581-w","article-title":"In-memory database acceleration on FPGAs: a survey","volume":"29","author":"Fang","year":"2020","journal-title":"The VLDB Journal"},{"issue":"4","key":"2026033109421009200_ref083","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2094114.2094126","article-title":"SAP HANA Database: Data Management for Modern Business Applications","volume":"40","author":"F\u00e4rber","year":"2011","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"2026033109421009200_ref084","first-page":"28","article-title":"The SAP HANA Database \u2013 An Architecture Overview","volume":"35","author":"rber","year":"2012","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"8","key":"2026033109421009200_ref085","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.14778\/3389133.3389135","article-title":"The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds","volume":"13","author":"Ferragina","year":"2020","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"2026033109421009200_ref086","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/125187.125200","article-title":"OrderPreserving Minimal Perfect Hash Functions and Information Retrieval","volume":"9","author":"Fox","year":"1991","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"2026033109421009200_ref087","unstructured":"Francisco, P.\n           (2011). \u201cThe Netezza Data Appliance Architecture: A Platform for High Performance Data Warehousing and Analytics\u201d. IBM Redbooks. URL: http:\/\/www.redbooks.ibm.com\/redpapers\/pdfs\/redp4725.pdf."},{"issue":"2","key":"2026033109421009200_ref088","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/568271.223871","article-title":"One size fits all\u201d database architectures do not work for DSS","volume":"24","author":"French","year":"1995","journal-title":"ACM SIGMOD Record"},{"key":"2026033109421009200_ref089","unstructured":"French, C. D.\n           (1997). \u201cTeaching an OLTP Database Kernel Advanced Data Warehousing Techniques\u201d. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE). 194\u2013198. url:http:\/\/dl.acm.org\/citation.cfm?id=645482.653422."},{"key":"2026033109421009200_ref090","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1145\/3299869.3319860","article-title":"FITing-Tree: A Data-aware Index Structure","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Galakatos","year":"2019"},{"issue":"6","key":"2026033109421009200_ref091","first-page":"526","article-title":"SharedDB: Killing One Thousand Queries with One Stone","volume":"5","author":"Giannikis","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref092","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1145\/2463676.2463678","article-title":"Workload optimization using SharedDB","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Giannikis","year":"2013"},{"key":"2026033109421009200_ref093","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/2628194.2628911","article-title":"MV-IDX: indexing in multi-version databases","volume-title":"Proceedings of the Symposium on International Database Engineering & Applications (IDEAS)","author":"Gottstein","year":"2014"},{"key":"2026033109421009200_ref094","unstructured":"Graefe, G.\n           (2003). \u201cSorting And Indexing With Partitioned B-Trees\u201d. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR). url:http:\/\/www-db.cs.wisc.edu\/cidr\/cidr2003\/program\/p1.pdf."},{"issue":"4","key":"2026033109421009200_ref095","first-page":"203","article-title":"Modern B-Tree Techniques","volume":"3","author":"Graefe","year":"2011","journal-title":"Foundations and Trends in Databases"},{"issue":"7","key":"2026033109421009200_ref096","first-page":"656","article-title":"Concurrency control for adaptive indexing","volume":"5","author":"Graefe","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref097","unstructured":"Graefe, G., S.Idreos, H.Kuno, and S.Manegold. (2010). \u201cBenchmarking adaptive indexing\u201d. In: Proceedings of the TPC Technology Conference on Performance Evaluation, Measurement and Characterization of Complex Systems (TPCTC). 169\u2013184. url:http:\/\/dl.acm.org\/citation.cfm?id=1946050.1946063."},{"key":"2026033109421009200_ref098","unstructured":"Graefe, G. and H.Kuno. (2010a). \u201cSelf-selecting, self-tuning, incrementally optimized indexes\u201d. In: Proceedings of the International Conference on Extending Database Technology (EDBT). 371\u2013381. url:http:\/\/dl.acm.org\/citation.cfm?id=1739041.1739087."},{"key":"2026033109421009200_ref099","first-page":"69","article-title":"Adaptive indexing for relational keys","volume-title":"Proceedings of the IEEE International Conference on Data Engineering Workshops (ICDEW)","author":"Graefe","year":"2010"},{"issue":"1","key":"2026033109421009200_ref100","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14778\/2 735461.2735465","article-title":"In-Memory Performance for Big Data","volume":"8","author":"Graefe","year":"2014","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref101","unstructured":"Gray, J. and F.Putzolu. (1986). \u201cThe 5 Minute Rule for Trading Memory for Disc Accesses and the 5 Byte Rule for Trading Memory for CPU Time\u201d. Tandem Computers - Technical Report. url:http:\/\/db.cs.berkeley.edu\/cs286\/papers\/fiveminute-tr1986.pdf."},{"issue":"2","key":"2026033109421009200_ref102","doi-asserted-by":"publisher","first-page":"105","DOI":"10.14778\/1921071.1921077","article-title":"HYRISE: A Main Memory Hybrid Storage Engine","volume":"4","author":"Grund","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref103","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/602259.60 2266","article-title":"R-Trees: A Dynamic Index Structure for Spatial Searching","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Guttman","year":"1984"},{"issue":"4","key":"2026033109421009200_ref104","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/2689412","article-title":"Rank-Balanced Trees","volume":"11","author":"Haeupler","year":"2015","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"6","key":"2026033109421009200_ref105","first-page":"502","article-title":"Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores.","volume":"5","author":"Halim","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref106","article-title":"A Case for Staged Database Systems","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Harizopoulos","year":"2003"},{"key":"2026033109421009200_ref107","unstructured":"Harizopoulos, S., V.Shkapenyuk, and A.Ailamaki. (2005). \u201cQPipe: A Simultaneously Pipelined Relational Query Engine\u201d. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 383\u2013394. URL: http:\/\/dl.acm.org\/citation.cfm?id=1066157.1066201."},{"issue":"1","key":"2026033109421009200_ref108","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/505241.505244","article-title":"On a Model of Indexability and Its Bounds for Range Queries","volume":"49","author":"Hellerstein","year":"2002","journal-title":"Journal of the ACM"},{"key":"2026033109421009200_ref109","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/263661.263688","article-title":"On the Analysis of Indexing Schemes","volume-title":"Proceedings of the ACM Symposium on Principles of Database Systems (PODS)","author":"Hellerstein","year":"1997"},{"key":"2026033109421009200_ref110","unstructured":"Hellerstein, J. M., J. F.Naughton, and A.Pfeffer. (1995). \u201cGeneralized Search Trees for Database Systems\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 562\u2013573. URL: http:\/\/dl.acm.org\/citation.cfm?id=645921.673145."},{"issue":"2","key":"2026033109421009200_ref111","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1561\/1900000002","article-title":"Architecture of a Database System","volume":"1","author":"Hellerstein","year":"2007","journal-title":"Foundations and Trends in Databases"},{"key":"2026033109421009200_ref112","unstructured":"H\u00e9man, S., M.Zukowski, and N. J.Nes. (2010). \u201cPositional Update Handling in Column Stores\u201d. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 543\u2013554. url:http:\/\/dl.acm.org\/citation.cfm?id=1807167.1807227."},{"key":"2026033109421009200_ref113","doi-asserted-by":"publisher","DOI":"10.1016\/C2011-0-06993-4","volume-title":"The Art of Multiprocessor Programming (Second Edition)","author":"Herlihy","year":"2020"},{"issue":"6025","key":"2026033109421009200_ref114","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1126\/science.1200970","article-title":"The World\u2019s Technological Capacity to Store, Communicate, and Compute Information","volume":"332","author":"Hilbert","year":"2011","journal-title":"Science"},{"issue":"13","key":"2026033109421009200_ref115","first-page":"2366","article-title":"Progressive Indexes: Indexing for Interactive Data Analysis","volume":"12","author":"Holanda","year":"2019","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref116","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/3299869.3314041","article-title":"X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Huang","year":"2019"},{"key":"2026033109421009200_ref117","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/3448016.3457297","article-title":"Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Huang","year":"2021"},{"issue":"12","key":"2026033109421009200_ref118","first-page":"3774","article-title":"The Past, Present and Future of Indexing on Persistent Memory","volume":"15","author":"Huang","year":"2022","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref119","volume-title":"IEEE Conference on Massive Data Storage","author":"Hughes","year":"2013"},{"key":"2026033109421009200_ref120","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/ICDE.1988.105505","article-title":"Globally Order Preserving Multidimensional Linear Hashing","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Hutflesz","year":"1988"},{"key":"2026033109421009200_ref121","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1145\/3318464.3383133","article-title":"Key-Value Storage Engines","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Idreos","year":"2020"},{"key":"2026033109421009200_ref122","article-title":"Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Idreos","year":"2019"},{"issue":"1","key":"2026033109421009200_ref123","first-page":"40","article-title":"MonetDB: Two Decades of Research in Column-oriented Database Architectures","volume":"35","author":"Idreos","year":"2012","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref124","article-title":"Database Cracking","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Idreos","year":"2007"},{"key":"2026033109421009200_ref125","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/1 247480.1247527","article-title":"Updating a Cracked Database","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Idreos","year":"2007"},{"key":"2026033109421009200_ref126","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/1559845.1559878","article-title":"Self-organizing Tuple Reconstruction in Column-Stores","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Idreos","year":"2009"},{"issue":"9","key":"2026033109421009200_ref127","first-page":"586","article-title":"Merging What\u2019s Cracked, Cracking What\u2019s Merged: Adaptive Indexing in Main-Memory Column-Stores","volume":"4","author":"Idreos","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"2026033109421009200_ref128","first-page":"64","article-title":"The Periodic Table of Data Structures","volume":"41","author":"Idreos","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"2","key":"2026033109421009200_ref129","first-page":"47","article-title":"Learning Data Structure Alchemy","volume":"42","author":"Idreos","year":"2019","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref130","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1145\/3183713.3199671","article-title":"The Data Calculator: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Idreos","year":"2018"},{"issue":"2","key":"2026033109421009200_ref131","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1561\/1900000072","article-title":"FPGA-Accelerated Analytics: From Single Nodes to Clusters","volume":"9","author":"Istv\u00e1n","year":"2020","journal-title":"Foundations and Trends in Databases"},{"key":"2026033109421009200_ref132","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/ISCA.2018.00070","article-title":"Gist: Efficient Data Encoding for Deep Neural Network Training","volume-title":"Proceedings of the ACM\/IEEE Annual International Symposium on Computer Architecture (ISCA)","author":"Jain","year":"2018"},{"key":"2026033109421009200_ref133","unstructured":"Jannen, W., J.Yuan, Y.Zhan, A.Akshintala, J.Esmet, Y.Jiao, A.Mittal, P.Pandey, P.Reddy, L.Walsh, M. A.Bender, M.Farach-Colton, R.Johnson, B. C.Kuszmaul, and D. E.Porter. (2015). \u201cBetrFS: A Right-optimized Write-optimized File System\u201d. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST). 301\u2013315. url:http:\/\/dl.acm.org\/citation.cfm?id=2750482.2750505."},{"issue":"11","key":"2026033109421009200_ref134","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1109\/TKDE.2017.2740932","article-title":"Time Series Management Systems: A Survey","volume":"29","author":"Jensen","year":"2017","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"2026033109421009200_ref135","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2103380.2103390","article-title":"FlashB-tree: A Novel B-tree Inex Scheme for Solid State Drives","volume-title":"Proceedings of the ACM Symposium on Research in Applied Computation (RACS)","author":"Jin","year":"2011"},{"key":"2026033109421009200_ref136","unstructured":"Johnson, R., S.Harizopoulos, N.Hardavellas, K.Sabirli, I.Pandis, A.Ailamaki, N. G.Mancheril, and B.Falsafi. (2007). \u201cTo Share or Not to Share?\u201d In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 351\u2013362. url:http:\/\/dl.acm.org\/citation.cfm?id=1325851.1325894."},{"key":"2026033109421009200_ref137","unstructured":"Johnson, R., I.Pandis, N.Hardavellas, A.Ailamaki, and B.Falsafi. (2009). \u201cShore-MT: a scalable storage manager for the multicore era\u201d. In: Proceedings of the International Conference on Extending Database Technology (EDBT). 24\u201335. url:http:\/\/dl.acm.org\/citation.cfm?id=1516360.1516365."},{"key":"2026033109421009200_ref138","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/73721.73745","article-title":"Utilization of B-trees with Inserts, Deletes and Modifies","volume-title":"Proceedings of the ACM Symposium on Principles of Database Systems (PODS)","author":"Johnson","year":"1989"},{"key":"2026033109421009200_ref139","unstructured":"Johnson, T. and D.Shasha. (1994). \u201c2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 439\u2013450. URL: http:\/\/dl.acm.org\/citation.cfm?id=645920.672996."},{"key":"2026033109421009200_ref140","unstructured":"Kang, D., D.Jung, J.-U.Kang, and J.-S. Kim. (2007). \u201cmu-tree: an ordered index structure for NAND flash memory\u201d. In: Proceedings of the ACM\/IEEE International Conference on Embedded Software (EMSOFT). 144\u2013153. URL: http:\/\/dl.acm.org\/citation.cfm?doid=1289927.1289953."},{"key":"2026033109421009200_ref141","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/3319647.3325831","article-title":"Towards building a high-performance, scale-in key-value storage system","volume-title":"Proceedings of the ACM International Conference on Systems and Storage (SYSTOR)","author":"Kang","year":"2019"},{"key":"2026033109421009200_ref142","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1145\/258533.258660","article-title":"Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web","volume-title":"Proceedings of the Annual ACM Symposium on the Theory of Computing (STOC)","author":"Karger","year":"1997"},{"key":"2026033109421009200_ref143","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/ICDE.2011.5767867","article-title":"HyPer: A Hybrid OLTP & OLAP Main Memory Database System Based on Virtual Memory Snapshots","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Kemper","year":"2011"},{"key":"2026033109421009200_ref144","unstructured":"Kennedy, O. and L.Ziarek. (2015). \u201cJust-In-Time Data Structures\u201d. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR). url:http:\/\/www.cidrdb.org\/cidr2015\/Papers\/CIDR15_Paper9.pdf."},{"key":"2026033109421009200_ref145","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/3 035918.3064049","article-title":"Access Path Selection in Main-Memory Optimized Data Systems: Should I Scan or Should I Probe?","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Kester","year":"2017"},{"key":"2026033109421009200_ref146","first-page":"371","volume-title":"Object-Oriented Concepts, Databases, and Applications","author":"Kim","year":"1989"},{"key":"2026033109421009200_ref147","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1145\/1989323.1989455","article-title":"Data management over flash memory","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Koltsidas","year":"2011"},{"key":"2026033109421009200_ref148","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/253260.253272","article-title":"Concurrency and Recovery in Generalized Search Trees","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Kornacker","year":"1997"},{"key":"2026033109421009200_ref149","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/3183713.3196909","article-title":"The Case for Learned Index Structures","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Kraska","year":"2018"},{"issue":"1","key":"2026033109421009200_ref150","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S01089ED1V01Y202104CSL013","article-title":"Automated Verification of Concurrent Search Structures","volume":"9","author":"Krishna","year":"2021","journal-title":"Synthesis Lectures on Computer Science"},{"key":"2026033109421009200_ref151","article-title":"A Comparison of Fractal Trees to Log-Structured Merge (LSM) Trees","volume-title":"Tokutek White Paper","author":"Kuszmaul","year":"2014"},{"key":"2026033109421009200_ref152","article-title":"Oracle Database In Memory: A Dual Format In-Memory Database","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Lahiri","year":"2015"},{"key":"2026033109421009200_ref153","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/106972.106981","article-title":"The Cache Performance and Optimizations of Blocked Algorithms","volume-title":"Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)","author":"Lam","year":"1991"},{"issue":"12","key":"2026033109421009200_ref154","first-page":"1790","article-title":"The Vertica Analytic Database: C-Store 7 Years Later","volume":"5","author":"Lamb","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref155","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882925","article-title":"Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Lang","year":"2016"},{"issue":"5","key":"2026033109421009200_ref156","first-page":"502","article-title":"Performance-Optimal Filtering: Bloom overtakes Cuckoo at High-Throughput","volume":"12","author":"Lang","year":"2019","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref157","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1145\/1989323.1989448","article-title":"SQL server column store indexes","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Larson","year":"2011"},{"issue":"1","key":"2026033109421009200_ref158","first-page":"15","article-title":"Columnar Storage in SQL Server 2012","volume":"35","author":"Larson","year":"2012","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref159","article-title":"Evolving the Architecture of SQL Server for Modern Hardware Trends","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Larson","year":"2015"},{"key":"2026033109421009200_ref160","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1145\/2463676.2463708","article-title":"Enhancements to SQL server column stores","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Larson","year":"2013"},{"key":"2026033109421009200_ref161","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-10856-4{\\_}78","article-title":"The Art of Dynamizing","volume-title":"Proceedings of Mathematical Foundations of Computer Science","author":"Leeuwenvan","year":"1981"},{"issue":"2","key":"2026033109421009200_ref162","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(80)90073-3","article-title":"Dynamization of Decomposable Searching Problems","volume":"10","author":"Leeuwenvan","year":"1980","journal-title":"Information Processing Letters"},{"issue":"4","key":"2026033109421009200_ref163","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient Locking for Concurrent Operations on B-Trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref164","unstructured":"Lehman, T. J. and M. J.Carey. (1986). \u201cA Study of Index Structures for Main Memory Database Management Systems\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 294\u2013303. url:http:\/\/www.vldb.org\/conf\/1986\/P294.PDF."},{"key":"2026033109421009200_ref165","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/ICDE.2013.6544812","article-title":"The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Leis","year":"2013"},{"key":"2026033109421009200_ref166","doi-asserted-by":"publisher","first-page":"2852","DOI":"10.1145\/3448016.3457540","article-title":"Not your Grandpa\u2019s SSD: The Era of Co-Designed Storage Devices","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Lerner","year":"2021"},{"key":"2026033109421009200_ref167","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/ICDE.2013.6544834","article-title":"The Bw-Tree: A B-tree for New Hardware Platforms","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Levandoski","year":"2013"},{"issue":"1\u20132","key":"2026033109421009200_ref168","first-page":"1195","article-title":"Tree Indexing on Solid State Drives","volume":"3","author":"Li","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref169","unstructured":"Lim, H., B.Fan, D. G.Andersen, and M.Kaminsky. (2011). \u201cSILT: A Memory-Efficient, High-Performance Key-Value Store\u201d. In: Proceedings of the ACM Symposium on Operating Systems Principles (SOSP). 1\u201313. url:http:\/\/dl.acm.org\/citation.cfm?id=2043556.2043558."},{"key":"2026033109421009200_ref170","unstructured":"Lin, K.-I., H. V.Jagadish, and C.Faloutsos. (1994). \u201cThe TV-Tree: An Index Structure for High-Dimensional Data\u201d. The VLDB Journal. 3(4): 517\u2013542. url:http:\/\/www.vldb.org\/journal\/VLDBJ3\/P517.pdf."},{"key":"2026033109421009200_ref171","first-page":"212","article-title":"Linear Hashing: A New Tool for File and Table Addressing","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)","year":"1980"},{"key":"2026033109421009200_ref172","unstructured":"Litwin, W. and D. B.Lomet. (1986). \u201cThe Bounded Disorder Access Method\u201d. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE). 38\u201348. url:http:\/\/dl.acm.org\/citation.cfm?id=645471.655390."},{"key":"2026033109421009200_ref173","unstructured":"Litwin, W., M.-A.Neimat, and D. A.Schneider. (1994). \u201cRP*: A Family of Order Preserving Scalable Distributed Data Structures\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 342\u2013353. URL: http:\/\/www.vldb.org\/conf\/1994\/P342.PDF."},{"issue":"4","key":"2026033109421009200_ref174","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/236711.236713","article-title":"LH* -A Scalable, Distributed Data Structure","volume":"21","author":"Litwin","year":"1996","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref175","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1145\/3183713.3183723","article-title":"Splaying Log-Structured Merge-Trees","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Lively","year":"2018"},{"issue":"4","key":"2026033109421009200_ref176","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/99935.99949","article-title":"The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance","volume":"15","author":"Lomet","year":"1990","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref177","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/130283.130336","article-title":"Access Method Concurrency with Recovery","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Lomet","year":"1992"},{"issue":"3","key":"2026033109421009200_ref178","first-page":"16","article-title":"Spatial Indexing: Past and Future","volume":"16","author":"Lu","year":"1993","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref179","unstructured":"Lu, L., T. S.Pillai, A. C.Arpaci-Dusseau, and R. H.Arpaci-Dusseau. (2016). \u201cWiscKey: Separating Keys from Values in SSD-conscious Storage\u201d. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST). 133\u2013148. url:https:\/\/www.usenix.org\/conference\/fast16\/technical-sessions\/presentation\/lu."},{"key":"2026033109421009200_ref180","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/ICDE53745.2022.00041","article-title":"DynaHash: Efficient Data Rebalancing in Apache AsterixDB","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Luo","year":"2022"},{"issue":"1","key":"2026033109421009200_ref181","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","article-title":"LSM-based Storage Techniques: A Survey","volume":"29","author":"Luo","year":"2020","journal-title":"The VLDB Journal"},{"issue":"12","key":"2026033109421009200_ref182","doi-asserted-by":"publisher","first-page":"4395","DOI":"10.1109\/TPDS.2022.3188656","article-title":"A Survey of Storage Systems in the RDMA Era","volume":"33","author":"Ma","year":"2022","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2026033109421009200_ref183","unstructured":"MacNicol, R. and B.French. (2004). \u201cSybase IQ Multiplex-Designed For Analytics\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 1227\u20131230. url:http:\/\/www.vldb.org\/conf\/2004\/IND8P3.PDF."},{"key":"2026033109421009200_ref184","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397536.3426358","article-title":"A Tutorial on Learned Multi-dimensional Indexes","volume-title":"Proceedings of the International Conference on Advances in Geographic Information Systems (SIG-SPATIAL)","author":"Al-Mamun","year":"2020"},{"key":"2026033109421009200_ref185","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/978-0-387-39940-9{\\_}657","article-title":"Memory Hierarchy","volume-title":"Encyclopedia of Database Systems","author":"Manegold","year":"2009"},{"key":"2026033109421009200_ref186","unstructured":"Manegold, S., P. A.Boncz, and M. L.Kersten. (2002a). \u201cGeneric Database Cost Models for Hierarchical Memory Systems\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 191\u2013202. url:http:\/\/dl.acm.org\/citation.cfm?id=1287369.1287387."},{"issue":"4","key":"2026033109421009200_ref187","doi-asserted-by":"publisher","first-page":"7O9","DOI":"10.1109\/TKDE.2002.1019210","article-title":"Optimizing Main-Memory Join on Modern Hardware","volume":"14","author":"Manegold","year":"2002","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"2026033109421009200_ref188","unstructured":"Manegold, S., P. A.Boncz, and N.Nes. (2004). \u201cCache-Conscious Radix-Decluster Projections\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 684\u2013695. url:http:\/\/www.vldb.org\/conf\/2004\/RS18P3.PDF."},{"key":"2026033109421009200_ref189","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628293-5","volume-title":"R-Trees: Theory and Applications. Advanced Information and Knowledge Processing","author":"Manolopoulos","year":"2006"},{"key":"2026033109421009200_ref190","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/2168836.2168855","article-title":"Cache Craftiness for Fast Multicore Key-value Storage","volume-title":"Proceedings of the ACM European Conference on Computer Systems (EuroSys)","author":"Mao","year":"2012"},{"key":"2026033109421009200_ref191","unstructured":"Margaritov, A., D.Ustiugov, E.Bugnion, and B.Grot. (2018). \u201cVirtual Address Translation via Learned Page Table Indexes\u201d. In: Proceedings of the Workshop on ML for Systems at NeurIPS. url:http:\/\/mlforsystems.org\/assets\/papers\/neurips2018\/virtual_margaritov_2018.pdf."},{"key":"2026033109421009200_ref192","unstructured":"Mediano, M. R., M. A.Casanova, and M.Dreux. (1994). \u201cV-Trees-A Storage Method for Long Vector Data\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 321\u2013330. url:http:\/\/www.vldb.org\/conf\/1994\/P321.PDF."},{"issue":"4","key":"2026033109421009200_ref193","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2004.1297303","article-title":"Outperforming LRU with an Adaptive Replacement Cache Algorithm","volume":"37","author":"Megiddo","year":"2004","journal-title":"Computer"},{"key":"2026033109421009200_ref194","unstructured":"Mehta, M., V.Soloviev, and D. J.DeWitt. (1993). \u201cBatch Scheduling in Parallel Database Systems\u201d. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE). 400\u2013410. url:http:\/\/ieeexplore.ieee.org\/lpdocs\/epicO3\/wrapper.htm?arnumber=344041."},{"issue":"2","key":"2026033109421009200_ref195","doi-asserted-by":"publisher","first-page":"25O","DOI":"10.1147\/sj.422.0250","article-title":"IBM Storage Tank-A heterogeneous scalable SAN file system","volume":"42","author":"Menon","year":"2003","journal-title":"IBM Systems Journal"},{"issue":"1","key":"2026033109421009200_ref196","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MC.2016.19","article-title":"Outlook on Operating Systems","volume":"49","author":"Milojicic","year":"2016","journal-title":"IEEE Computer"},{"key":"2026033109421009200_ref197","unstructured":"Moerkotte, G.\n           (1998). \u201cSmall Materialized Aggregates: A Light Weight Index Structure for Data Warehousing\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 476\u2013487. URL: http:\/\/dl.acm.org\/citation.cfm?id=645924.671173."},{"key":"2026033109421009200_ref198","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2014.72","article-title":"Tutorial: An In-Depth Look at Modern Database Systems","volume":"674","author":"Mohan","year":"2014","journal-title":"Proceedings of the International Conference on Extending Database Technology (EDBT)"},{"issue":"4","key":"2026033109421009200_ref199","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric","volume":"15","author":"Morrison","year":"1968","journal-title":"Journal of the ACM"},{"issue":"3\u20134","key":"2026033109421009200_ref200","first-page":"199","article-title":"The LHAM Log-structured History Data Access Method","volume":"8","author":"Muth","year":"2000","journal-title":"The VLDB Journal"},{"issue":"1","key":"2026033109421009200_ref201","first-page":"111","article-title":"IPLB+-tree for Flash Memory Database Systems","volume":"27","author":"Na","year":"2011","journal-title":"Journal of Information Science and Engineering (JISE)"},{"key":"2026033109421009200_ref202","first-page":"7937","article-title":"Memory-Efficient Pipeline-Parallel DNN Training","volume":"139","author":"Narayanan","year":"2021","journal-title":"Proceedings of the International Conference on Machine Learning (ICML)"},{"key":"2026033109421009200_ref203","article-title":"FlashDB: dynamic self-tuning database for NAND flash","volume-title":"Proceedings of the International Symposium on Information Processing in Sensor Networks (IPSN)","author":"Nath","year":"2007"},{"key":"2026033109421009200_ref204","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/170035.170081","article-title":"The LRU-K page replacement algorithm for database disk buffering","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Neil","year":"1993"},{"key":"2026033109421009200_ref205","unstructured":"O\u2019Neil, P. E., E.Cheng, D.Gawlick, and E. J.O\u2019Neil. (1996). \u201cThe log-structured merge-tree (LSM-tree)\u201d. Acta Informatica. 33(4): 351\u2013385. url:http:\/\/dl.acm.org\/citation.cfm?id=230823.230826."},{"issue":"1","key":"2026033109421009200_ref206","first-page":"569","article-title":"Adaptive partitioning and indexing for in situ query processing","volume":"29","author":"Olma","year":"2020","journal-title":"The VLDB Journal"},{"key":"2026033109421009200_ref207","article-title":"Indexing in Spatial Databases","volume-title":"Tech. rep.","author":"Ooi","year":"1993"},{"issue":"4","key":"2026033109421009200_ref208","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","article-title":"Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems","volume":"12","author":"Overmars","year":"1981","journal-title":"Information Processing Letters"},{"key":"2026033109421009200_ref209","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1145\/3448016.3452841","article-title":"Vector Quotient Filters: Overcoming the Time\/Space Trade-Off in Filter Design","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Pandey","year":"2021"},{"key":"2026033109421009200_ref210","article-title":"A Parametric I\/O Model for Modern Storage Devices","volume-title":"Proceedings of the International Workshop on Data Management on New Hardware (DAMON)","author":"Papon","year":"2021"},{"key":"2026033109421009200_ref211","article-title":"The Need for a New I\/O Model","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Papon","year":"2021"},{"key":"2026033109421009200_ref212","article-title":"ACEing the Bufferpool Management Paradigm for Modern Storage Devices","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Papon","year":"2023"},{"issue":"1","key":"2026033109421009200_ref213","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1 900000076","article-title":"Database Systems on GPUs","volume":"11","author":"Paul","year":"2021","journal-title":"Foundations and Trends in Databases"},{"issue":"7","key":"2026033109421009200_ref214","first-page":"550","article-title":"Interpolation Search\u2014A log logN Search","volume":"21","author":"Perl","year":"1978","journal-title":"Communications of the ACM"},{"key":"2026033109421009200_ref215","article-title":"Holistic Indexing in Main-memory Column-stores","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Petraki","year":"2015"},{"issue":"2\u20133","key":"2026033109421009200_ref216","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s00778-019-00546-z","article-title":"Joins on high-bandwidth memory: a new level in the memory hierarchy","volume":"29","author":"Pohl","year":"2020","journal-title":"The VLDB Journal"},{"key":"2026033109421009200_ref217","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1145\/2723372.2747645","article-title":"Rethinking SIMD Vectorization for In-Memory Databases","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Polychroniou","year":"2015"},{"key":"2026033109421009200_ref218","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/ICDE.2014.6816692","article-title":"ATraPos: Adaptive transaction processing on hardware Islands","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Porobic","year":"2014"},{"issue":"9","key":"2026033109421009200_ref219","first-page":"637","article-title":"Sharing Data and Work Across Concurrent Analytical Queries","volume":"6","author":"Psaroudakis","year":"2013","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"6","key":"2026033109421009200_ref220","first-page":"668","article-title":"Skip Lists: A Probabilistic Alternative to Balanced Trees","volume":"33","author":"Pugh","year":"1990","journal-title":"Communications of the ACM"},{"issue":"1","key":"2026033109421009200_ref221","first-page":"610","article-title":"Main-memory Scan Sharing for Multi-core CPUs","volume":"1","author":"Qiao","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref222","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1145\/2882903.2914836","article-title":"Adaptive Data Skipping in Main-Memory Systems","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Qin","year":"2016"},{"key":"2026033109421009200_ref223","volume-title":"Database Management Systems","author":"Ramakrishnan","year":"2002","edition":"3"},{"key":"2026033109421009200_ref224","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/s00778-003-0093-1","article-title":"A Case for Fractured Mirrors","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)","author":"Ramamurthy","year":"2002"},{"issue":"2","key":"2026033109421009200_ref225","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00778-003-0093-1","article-title":"A Case for Fractured Mirrors","volume":"12","author":"Ramamurthy","year":"2003","journal-title":"The VLDB Journal"},{"key":"2026033109421009200_ref226","article-title":"Indexing for Near-Sorted Data","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Raman","year":"2023"},{"issue":"11","key":"2026033109421009200_ref227","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.14778\/2536222.2536233","article-title":"DB2 with BLU Acceleration: So Much More Than Just a Column Store","volume":"6","author":"Raman","year":"2013","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref228","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/ICDE.2008.4497414","article-title":"Constant-Time Query Processing","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Raman","year":"2008"},{"key":"2026033109421009200_ref229","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/342009.335449","article-title":"Making B+-trees Cache Conscious in Main Memory","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Rao","year":"2000"},{"key":"2026033109421009200_ref230","doi-asserted-by":"publisher","first-page":"217","DOI":"10.5441\/002\/edbt.2020.20","article-title":"MV-PBT: Multi-Version Indexing for Large Datasets and HTAP Workloads","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT)","author":"Riegger","year":"2020"},{"key":"2026033109421009200_ref231","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/3151759.3151779","article-title":"Multi-version indexing and modern hardware technologies: a survey of present indexing approaches","volume-title":"Proceedings of the International Conference on Information Integration and Web-based Applications & Services (iiWAS)","author":"Riegger","year":"2017"},{"key":"2026033109421009200_ref232","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/3331076.3331118","article-title":"Indexing large updatable datasets in multi-version database management systems","volume-title":"Proceedings of the Symposium on International Database Engineering & Applications (IDEAS)","author":"Riegger","year":"2019"},{"key":"2026033109421009200_ref233","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/582318.582321","article-title":"The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Robinson","year":"1981"},{"key":"2026033109421009200_ref234","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/6012.6014","article-title":"Order Preserving Linear Hashing Using Dynamic Key Statistics","volume-title":"Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 24-26, 1986, Cambridge, Massachusetts, USA","author":"Robinson","year":"1986"},{"issue":"4","key":"2026033109421009200_ref235","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1326542.1326544","article-title":"B-trees, shadowing, and clones","volume":"3","author":"Rodeh","year":"2008","journal-title":"ACM Transactions on Storage"},{"issue":"4","key":"2026033109421009200_ref236","first-page":"286","article-title":"B+-Tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives","volume":"5","author":"Roh","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref237","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3460535","article-title":"Utilizing (and Designing) Modern Hardware for Data-Intensive Computations: The Role of Abstraction","volume":"1","author":"Ross","year":"2021","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"2026033109421009200_ref238","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/974750.974755","article-title":"Selection Conditions in Main Memory","volume":"29","author":"Ross","year":"2004","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"3","key":"2026033109421009200_ref239","first-page":"532","article-title":"Can Learned Models Replace Hash Functions?","volume":"16","author":"Sabek","year":"2022","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref240","unstructured":"Sacco, G. M.\n           (1987). \u201cIndex Access with a Finite Buffer\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 301\u2013309. url:http:\/\/www.vldb.org\/conf\/1987\/P301.PDF."},{"issue":"2","key":"2026033109421009200_ref241","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","article-title":"Concurrent Operations on B*-Trees with Overtaking","volume":"33","author":"Sagiv","year":"1986","journal-title":"Journal of Computer and System Sciences (JCSS)"},{"key":"2026033109421009200_ref242","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1145\/3514221.3522563","article-title":"Dissecting, Designing, and Optimizing LSM-based Data Stores","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Sarkar","year":"2022"},{"key":"2026033109421009200_ref243","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1145\/3514221.3520169","article-title":"Compactionary: A Dictionary for LSM Compactions","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Sarkar","year":"2022"},{"key":"2026033109421009200_ref244","article-title":"The LSM Design Space and its Read Optimizations","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Sarkar","year":"2023"},{"key":"2026033109421009200_ref245","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1145\/3318464.3389757","article-title":"Lethe: A Tunable Delete-Aware LSM Engine","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Sarkar","year":"2020"},{"issue":"11","key":"2026033109421009200_ref246","first-page":"2216","article-title":"Constructing and Analyzing the LSM Compaction Design Space","volume":"14","author":"Sarkar","year":"2021","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref247","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1565694.1565705","article-title":"k-ary search on modern processors","volume-title":"Proceedings of the International Workshop on Data Management on New Hardware (DAMON)","author":"Schlegel","year":"2009"},{"issue":"1","key":"2026033109421009200_ref248","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0747-7171(89)80002-1","article-title":"General Methods for Adding Range Restrictions to Decomposable Searching Problems","volume":"7","author":"Scholten","year":"1989","journal-title":"Journal of Symbolic Computation"},{"key":"2026033109421009200_ref249","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/ICDE.2018.00066","article-title":"Adaptive Adaptive Indexing","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Schuhknecht","year":"2018"},{"key":"2026033109421009200_ref250","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/2213836.2213862","article-title":"bLSM: A General Purpose Log Structured Merge Tree","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Sears","year":"2012"},{"key":"2026033109421009200_ref251","volume-title":"Algorithms","author":"Sedgewick","year":"1983"},{"key":"2026033109421009200_ref252","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/582095.582099","article-title":"Access Path Selection in a Relational Database Management System","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Selinger","year":"1979"},{"issue":"3","key":"2026033109421009200_ref253","first-page":"256","article-title":"Differential files: their application to the maintenance of large databases","volume":"1","author":"Severance","year":"1976","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"1","key":"2026033109421009200_ref254","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/42201.42204","article-title":"Concurrent Search Structure Algorithms","volume":"13","author":"Shasha","year":"1988","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref255","article-title":"Bitcask: A Log-Structured Hash Table for Fast Key\/Value Data","volume-title":"Basho White Paper","author":"Sheehy","year":"2010"},{"key":"2026033109421009200_ref256","unstructured":"Shehabi, A., S.Smith, D.Sartor, R.Brown, M.Herrlin, J.Koomey, E.Masanet, N.Horner, I.Azevedo, and W.Lintner. (2016). \u201cUnited States Data Center Energy Usage Report\u201d. Ernest Orlando Lawrence Berkeley National Laboratory. LBNL-10057. url:https:\/\/eta.lbl.gov\/publications\/united-states-data-center-energy."},{"key":"2026033109421009200_ref257","unstructured":"Sidirourgos, L. and M. L.Kersten. (2013). \u201cColumn Imprints: A Secondary Index Structure\u201d. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 893\u2013904. url:http:\/\/dl.acm.org\/citation.cfm?id=2463676.2465306."},{"issue":"3","key":"2026033109421009200_ref258","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-Adjusting Binary Search Trees","volume":"32","author":"Sleator","year":"1985","journal-title":"Journal of the ACM"},{"issue":"3","key":"2026033109421009200_ref259","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/320263.320276","article-title":"Sequentiality and Prefetching in Database Systems","volume":"3","author":"Smith","year":"1978","journal-title":"ACM Trans. Database Syst."},{"key":"2026033109421009200_ref260","article-title":"Digital Data Storage Outlook","volume-title":"Spectra White Paper","author":"Spectra","year":"2017"},{"issue":"7","key":"2026033109421009200_ref261","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/358699.358703","article-title":"Operating System Support for Database Management","volume":"24","author":"Stonebraker","year":"1981","journal-title":"Communications of the ACM"},{"key":"2026033109421009200_ref262","unstructured":"Stonebraker, M., D. J.Abadi, A.Batkin, X.Chen, M.Cherniack, M.Ferreira, E.Lau, A.Lin, S. R.Madden, E. J. O\u2019Neil, P. E.O\u2019Neil, A.Rasin, N.Tran, and S.Zdonik. (2005). \u201cC-Store: A Column-oriented DBMS\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 553\u2013564. url:http:\/\/dl.acm.org\/citation.cfm?id=1083592.1083658."},{"key":"2026033109421009200_ref263","unstructured":"Sweeney, A., D.Doucette, W.Hu, C.Anderson, M.Nishimoto, and G.Peck. (1996). \u201cScalability in the XFS File System\u201d. In: Proceedings of the USENIX Annual Technical Conference (ATC). 1\u201314. url:http:\/\/www.usenix.org\/publications\/library\/proceedings\/sd96\/sweeney.html."},{"issue":"3","key":"2026033109421009200_ref264","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/1020067","article-title":"Complexity of Combinatorial Algorithms","volume":"20","author":"Tarjan","year":"1978","journal-title":"SIAM Review"},{"key":"2026033109421009200_ref265","doi-asserted-by":"publisher","first-page":"485","DOI":"10.5441\/002\/edbt.2018.53","article-title":"MetisIDX - From Adaptive to Predictive Data Indexing","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT)","author":"Teixeira","year":"2018"},{"key":"2026033109421009200_ref266","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1145\/2396761.2398437","article-title":"A Practical Concurrent Index for Solid-State Drives","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM)","author":"Thonangi","year":"2012"},{"issue":"1","key":"2026033109421009200_ref267","first-page":"706","article-title":"Predictable Performance for Unpredictable Workloads","volume":"2","author":"Unterbrunner","year":"2009","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026033109421009200_ref268","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3299869.3300075","article-title":"Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Sandt","year":"2019"},{"issue":"3","key":"2026033109421009200_ref269","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","article-title":"An Efficient Multiversion Access STructure","volume":"9","author":"Varman","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"2026033109421009200_ref270","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1145\/2723372.2731082","article-title":"Data Management in Non-Volatile Memory","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Viglas","year":"2015"},{"issue":"2","key":"2026033109421009200_ref271","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384 193","article-title":"External Memory Algorithms and Data Structures","volume":"33","author":"Vitter","year":"2001","journal-title":"ACM Computing Surveys"},{"key":"2026033109421009200_ref272","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1145\/3448016.3457541","article-title":"Deep Learning: Systems and Responsibility","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Wasay","year":"2021"},{"key":"2026033109421009200_ref273","unstructured":"Wasay, A., B.Hentschel, Y.Liao, S.Chen, and S.Idreos. (2020). \u201cMotherNets: Rapid Deep Ensemble Learning\u201d. In: Proceedings of Machine Learning and Systems (MLSys). url:https:\/\/proceedings.mlsys.org\/book\/301.pdf."},{"key":"2026033109421009200_ref274","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/3035918.3064051","article-title":"Data Canopy: Accelerating Exploratory Statistical Analysis","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Wasay","year":"2017"},{"key":"2026033109421009200_ref275","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1583991.1584055","article-title":"Dynamic external hashing: the limit of buffering","volume-title":"Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"Wei","year":"2009"},{"key":"2026033109421009200_ref276","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","article-title":"Linear Pattern Matching Algorithms","volume-title":"Proceedings of the Annual Symposium on Switching and Automata Theory (SWAT)","author":"Weiner","year":"1973"},{"issue":"1","key":"2026033109421009200_ref277","first-page":"385","article-title":"SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units","volume":"2","author":"Willhalm","year":"2009","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"2026033109421009200_ref278","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/122576.122577","article-title":"Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware","volume":"19","author":"Wilson","year":"1991","journal-title":"SIGARCH Computer Architecture News"},{"issue":"1","key":"2026033109421009200_ref279","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0209009","article-title":"An Efficient Method for Weighted Sampling Without Replacement","volume":"9","author":"Wong","year":"1980","journal-title":"SIAM Journal on Computing (SICOMP)"},{"issue":"1","key":"2026033109421009200_ref280","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132863.1132864","article-title":"Optimizing Bitmap Indices with Efficient Compression","volume":"31","author":"Wu","year":"2006","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026033109421009200_ref281","unstructured":"Wu, X., Y.Xu, Z.Shao, and S.Jiang. (2015). \u201cLSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items\u201d. In: Proceedings of the USENIX Annual Technical Conference (ATC). 71\u201382. url:https:\/\/www.usenix.org\/conference\/atc15\/technical-session\/presentation\/wu."},{"issue":"1","key":"2026033109421009200_ref282","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/216585.216588","article-title":"Hitting the Memory Wall: Implications of the Obvious","volume":"23","author":"Wulf","year":"1995","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"2026033109421009200_ref283","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/SFCS.1976.32","article-title":"The Complexity of Searching an Ordered Random Table (Extended Abstract)","volume-title":"Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Yao","year":"1976"},{"key":"2026033109421009200_ref284","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/1559795.1559825","article-title":"Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes","volume-title":"Proceedings of the ACM Symposium on Principles of Database Systems (PODS)","author":"Yi","year":"2009"},{"issue":"4","key":"2026033109421009200_ref285","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2339123.2339129","article-title":"Dynamic Indexability and the Optimality of B-Trees","volume":"59","author":"Yi","year":"2012","journal-title":"Journal of the ACM"},{"issue":"6","key":"2026033109421009200_ref286","doi-asserted-by":"publisher","DOI":"10.3390\/a16060278","article-title":"Forgetful Forests: Data Structures for Machine Learning on Streaming Data under Concept Drift","volume":"16","author":"Yuan","year":"2023","journal-title":"Algorithms"},{"issue":"7","key":"2026033109421009200_ref287","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1109\/TKDE.2015.2427795","article-title":"In Memory Big Data Management and Processing: A Survey","volume":"27","author":"Zhang","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"2026033109421009200_ref288","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1145\/2882903.2915222","article-title":"Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Zhang","year":"2016"},{"key":"2026033109421009200_ref289","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/1007568.1007592","article-title":"Buffering Database Operations for Enhanced Instruction Cache Performance","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Zhou","year":"2004"},{"key":"2026033109421009200_ref290","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1109\/ICDE.2018.00211","article-title":"Data Series Management: Fulfilling the Need for Big Sequence Analytics","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Zoumpatianos","year":"2018"},{"issue":"1","key":"2026033109421009200_ref291","first-page":"21","article-title":"Vectorwise: Beyond Column Stores","volume":"35","author":"Zukowski","year":"2012","journal-title":"IEEE Data Engineering Bulletin"},{"key":"2026033109421009200_ref292","unstructured":"Zukowski, M., S.H\u00e9man, N. J.Nes, and P. A.Boncz. (2007). \u201cCooperative Scans: Dynamic Bandwidth Sharing in a DBMS\u201d. In: Proceedings of the International Conference on Very Large Data Bases (VLDB). 723\u2013734. url:http:\/\/dl.acm.org\/citation.cfm?id=1325851.1325934."}],"container-title":["Foundations and Trends\u00ae in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/13\/1-2\/1\/11097922\/1900000059en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/13\/1-2\/1\/11097922\/1900000059en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:11:40Z","timestamp":1777471900000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftdbs\/article\/13\/1-2\/1\/1330350\/Data-Structures-for-Data-Intensive-Applications"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,31]]},"references-count":292,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,7,31]]}},"URL":"https:\/\/doi.org\/10.1561\/1900000059","relation":{},"ISSN":["1931-7883","1931-7891"],"issn-type":[{"value":"1931-7883","type":"print"},{"value":"1931-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,31]]}}}