DBScholar

Back to papers

Design Tradeoffs of Data Access Methods

Summary: Survey of data access method design across SQL, NoSQL, and NewSQL, highlighting tradeoffs among read, update, and memory usage. Explores tunable, adaptable access methods, lessons from past work, and open questions under evolving hardware/workload demands. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5274
Venue
SIGMOD
Year
2016
Pagerank
6.4904836e-05
Overall Rank
4,826 | 66.90%
DOI
10.1145/2882903.2912569

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{athanassoulis_sigmod16,
        title = {{Design Tradeoffs of Data Access Methods}},
        author = {Athanassoulis, Manos and Idreos, Stratos},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2912569},
        url = {https://dl.acm.org/doi/10.1145/2882903.2912569},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank Citing Paper Year Venue Pagerank
446 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00018332392
790 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.0001401445
1,954 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.4208165e-05
2,866 Optimal Column Layout for Hybrid Workloads 2019 VLDB 8.0175489e-05
3,005 Constructing and Analyzing the LSM Compaction Design Space 2021 VLDB 7.8608206e-05
3,413 Slalom: Coasting Through Raw Data via Adaptive Partitioning and Indexing 2017 VLDB 7.4326381e-05
5,229 Dissecting, Designing, and Optimizing LSM-based Data Stores 2022 SIGMOD 6.307514e-05
7,274 LSM-Trees and B-Trees: The Best of Both Worlds 2019 SIGMOD 5.658769e-05
11,257 On Reducing Space Amplification with Multi-Column Compaction in Apache IoTDB 2024 VLDB 5.093636e-05
11,989 Alpine: Efficient In situ Data Exploration in the Presence of Updates 2017 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 38 of 38 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0020210012
12 C-Store: A Column-oriented DBMS 2005 VLDB 0.00069513174
59 Differential Files: Their Application To The Maintenance Of Large Data Bases 1976 SIGMOD 0.00040060625
67 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00038461275
104 Improved Query Performance with Variant Indexes 1997 SIGMOD 0.00033932213
156 An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server 1997 VLDB 0.00028636811
165 DB2 with BLU Acceleration: So Much More than Just a Column Store 2013 VLDB 0.00027693424
227 Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing 1998 VLDB 0.00023958508
259 Database Cracking 2007 CIDR 0.00023119313
275 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022630189
425 Shark: SQL and Rich Analytics at Scale 2013 SIGMOD 0.00018704491
468 Fast Time Sequence Indexing for Arbitrary Lp Norms 2000 VLDB 0.00017986163
512 Tree Indexing on Solid State Drives 2010 VLDB 0.00017196795
789 Don't Thrash: How to Cache Your Hash on Flash 2012 VLDB 0.0001401724
794 Bitmap Index Design and Evaluation 1998 SIGMOD 0.00013969303
961 Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices 2009 VLDB 0.00012941098
970 Sybase IQ Multiplex – Designed For Analytics 2004 VLDB 0.00012882125
981 Incremental Organization for Data Recording and Warehousing 1997 VLDB 0.0001284025
1,044 Fine-grained Partitioning for Aggressive Data Skipping 2014 SIGMOD 0.0001244236
1,112 Cache-Oblivious String B-trees 2006 PODS 0.00012125766
1,136 Bit Transposed Files 1985 VLDB 0.00012027691
1,464 An Efficient Bitmap Encoding Scheme for Selection Queries 1999 SIGMOD 0.00010689981
1,492 BF-Tree: Approximate Tree Indexing 2014 VLDB 0.00010588267
1,507 Column Imprints: A Secondary Index Structure 2013 SIGMOD 0.0001054177
1,508 Sorting And Indexing With Partitioned B-Trees 2003 CIDR 0.00010540965
1,629 Positional Update Handling in Column Stores 2010 SIGMOD 0.00010184131
1,679 Self-organizing Tuple Reconstruction in Column-stores 2009 SIGMOD 0.00010029136
1,811 Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores 2011 VLDB 9.698026e-05
1,854 Towards a One Size Fits All Database Architecture 2011 CIDR 9.6069414e-05
2,378 The Uncracked Pieces in Database Cracking 2014 VLDB 8.6682285e-05
3,009 The Case for RodentStore, an Adaptive, Declarative Storage System 2009 CIDR 7.8541296e-05
3,558 Updating a Cracked Database 2007 SIGMOD 7.3101789e-05
3,830 Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores 2012 VLDB 7.0877801e-05
4,883 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.4648124e-05
4,988 UpBit: Scalable In-Memory Updatable Bitmap Indexing 2016 SIGMOD 6.4107392e-05
5,564 MaSM: Efficient Online Updates in Data Warehouses 2011 SIGMOD 6.1716245e-05
5,903 Concurrency Control for Adaptive Indexing 2012 VLDB 6.0464632e-05
6,429 Just-In-Time Data Structures 2015 CIDR 5.8805678e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 14,083 Tutorial: Data Access 2000 SIGMOD
2 3,876 Cracking the Database Store 2005 CIDR
3 29 Database Architecture Optimized for the New Bottleneck: Memory Access 1999 VLDB
4 768 Automatic Physical Database Tuning: A Relaxation-based Approach 2005 SIGMOD
5 4,993 Key-Value Storage Engines 2020 SIGMOD
6 12,148 Databases and Hardware: The Beginning and Sequel of a Beautiful Friendship 2015 VLDB
7 2,870 Database Architectures for New Hardware 2004 VLDB
8 630 Performance Tradeoffs in Read-Optimized Databases 2006 VLDB
9 13,675 I/O Characteristics of NoSQL Databases 2012 VLDB
10 5,978 From Auto-tuning One Size Fits All to Self-designed and Learned Data-intensive Systems 2019 SIGMOD