Aneesh Raman

Orcid: 0009-0001-2164-0109

According to our database1, Aneesh Raman authored at least 8 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
QuIT your B+-tree for the Quick Insertion Tree.
Proceedings of the Proceedings 28th International Conference on Extending Database Technology, 2025

2024
Benchmarking Learned and LSM Indexes for Data Sortedness.
Proceedings of the Tenth International Workshop on Testing Database Systems, 2024

2023
Indexing for Near-Sorted Data.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
OSM-tree: A Sortedness-Aware Index.
CoRR, 2022

BoDS: A Benchmark on Data Sortedness.
Proceedings of the Performance Evaluation and Benchmarking, 2022

LSM-Trees Under (Memory) Pressure.
Proceedings of the International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures, 2022

2021
Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices.
Proceedings of the 17th International Workshop on Data Management on New Hardware, 2021

2019
Micro-Level Incident Analysis using Spatial Association Rule Mining.
Proceedings of the 2019 IEEE International Conference on Big Knowledge, 2019


  Loading...