Följ
Aneesh Raman
Aneesh Raman
Boston University
Verifierad e-postadress på bu.edu - Startsida
Titel
Citeras av
Citeras av
År
Reducing bloom filter cpu overhead in lsm-trees on modern storage devices
Z Zhu, JH Mun, A Raman, M Athanassoulis
Proceedings of the 17th International Workshop on Data Management on New …, 2021
202021
LSM-Trees Under (Memory) Pressure
JH Mun, Z Zhu, A Raman, M Athanassoulis
nternational Workshop on Accelerating Analytics and Data Management Systems …, 2022
82022
Indexing for near-sorted data
A Raman, S Sarkar, M Olma, M Athanassoulis
2023 IEEE 39th International Conference on Data Engineering (ICDE), 1475-1488, 2023
5*2023
BoDS: A benchmark on data sortedness
A Raman, K Karatsenidis, S Sarkar, M Olma, M Athanassoulis
Technology Conference on Performance Evaluation and Benchmarking, 17-32, 2022
52022
Micro-level incident analysis using spatial association rule mining
JS Yoo, SJ Park, A Raman
2019 IEEE International Conference on Big Knowledge (ICBK), 310-317, 2019
22019
Benchmarking Learned and LSM Indexes for Data Sortedness
A Raman, A Huynh, J Lu, M Athanassoulis
Proceedings of the Tenth International Workshop on Testing Database Systems …, 2024
12024
QuIT your B+-tree for the Quick Insertion Tree
A Raman, K Karatsenidis, S Xie, M Olma, S Sarkar, M Athanassoulis
complexity 25, 50, 2025
2025
BenchLex: A Sorted Benchmark forALEX
C Henzinger, A Song, S Basil, A Huynh, A Raman, M Athanassoulis
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–8