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
hec080ac911bd385e
Venue
SIGMOD
Year
2016
Pagerank
6.3706825e-05
Overall Rank
4,885 | 67.16%
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
400 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00019129175
779 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.00014030069
1,980 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.2595896e-05
2,770 Constructing and Analyzing the LSM Compaction Design Space 2021 VLDB 8.037607e-05
2,882 Optimal Column Layout for Hybrid Workloads 2019 VLDB 7.9116043e-05
3,445 Slalom: Coasting Through Raw Data via Adaptive Partitioning and Indexing 2017 VLDB 7.2943981e-05
5,046 Dissecting, Designing, and Optimizing LSM-based Data Stores 2022 SIGMOD 6.3000825e-05
6,635 LSM-Trees and B-Trees: The Best of Both Worlds 2019 SIGMOD 5.7263609e-05
11,586 On Reducing Space Amplification with Multi-Column Compaction in Apache IoTDB 2024 VLDB 4.9793485e-05
12,287 Alpine: Efficient In situ Data Exploration in the Presence of Updates 2017 SIGMOD 4.9793485e-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.001992968
12 C-Store: A Column-oriented DBMS 2005 VLDB 0.00068998927
59 Differential Files: Their Application To The Maintenance Of Large Data Bases 1976 SIGMOD 0.00039605949
69 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00037950385
107 Improved Query Performance with Variant Indexes 1997 SIGMOD 0.00033460288
151 An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server 1997 VLDB 0.00028672526
163 DB2 with BLU Acceleration: So Much More than Just a Column Store 2013 VLDB 0.0002749118
216 Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing 1998 VLDB 0.00024485024
253 Database Cracking 2007 CIDR 0.00023042111
258 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022939599
432 Shark: SQL and Rich Analytics at Scale 2013 SIGMOD 0.00018339357
478 Fast Time Sequence Indexing for Arbitrary Lp Norms 2000 VLDB 0.00017631293
513 Tree Indexing on Solid State Drives 2010 VLDB 0.00017044842
773 Bitmap Index Design and Evaluation 1998 SIGMOD 0.00014084831
789 Don't Thrash: How to Cache Your Hash on Flash 2012 VLDB 0.0001397781
966 Incremental Organization for Data Recording and Warehousing 1997 VLDB 0.0001279879
980 Sybase IQ Multiplex – Designed For Analytics 2004 VLDB 0.00012720677
981 Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices 2009 VLDB 0.00012716964
1,036 Fine-grained Partitioning for Aggressive Data Skipping 2014 SIGMOD 0.00012377471
1,074 Cache-Oblivious String B-trees 2006 PODS 0.00012162592
1,151 Bit Transposed Files 1985 VLDB 0.00011808563
1,497 An Efficient Bitmap Encoding Scheme for Selection Queries 1999 SIGMOD 0.00010478458
1,510 BF-Tree: Approximate Tree Indexing 2014 VLDB 0.00010438563
1,529 Column Imprints: A Secondary Index Structure 2013 SIGMOD 0.00010348765
1,539 Sorting And Indexing With Partitioned B-Trees 2003 CIDR 0.00010316015
1,632 Positional Update Handling in Column Stores 2010 SIGMOD 0.00010021251
1,694 Self-organizing Tuple Reconstruction in Column-stores 2009 SIGMOD 9.8562172e-05
1,836 Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores 2011 VLDB 9.535551e-05
1,848 Towards a One Size Fits All Database Architecture 2011 CIDR 9.5082163e-05
2,383 The Uncracked Pieces in Database Cracking 2014 VLDB 8.5435328e-05
3,056 The Case for RodentStore, an Adaptive, Declarative Storage System 2009 CIDR 7.6972474e-05
3,606 Updating a Cracked Database 2007 SIGMOD 7.1686756e-05
3,878 Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores 2012 VLDB 6.9512776e-05
4,810 UpBit: Scalable In-Memory Updatable Bitmap Indexing 2016 SIGMOD 6.4050834e-05
4,986 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.3264608e-05
5,637 MaSM: Efficient Online Updates in Data Warehouses 2011 SIGMOD 6.0569403e-05
6,005 Concurrency Control for Adaptive Indexing 2012 VLDB 5.9164805e-05
6,452 Just-In-Time Data Structures 2015 CIDR 5.7804153e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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