A comparison of adaptive radix trees and hash tables

@article{lvarez2015ACO,
  title={A comparison of adaptive radix trees and hash tables},
  author={V. {\'A}lvarez and Stefan Richter and Xiao Chen and J. Dittrich},
  journal={2015 IEEE 31st International Conference on Data Engineering},
  year={2015},
  pages={1227-1238}
}
With prices of main memory constantly decreasing, people nowadays are more interested in performing their computations in main memory, and leave high I/O costs of traditional disk-based systems out of the equation. [...] Key Result The authors of ART presented experiments that indicate that ART was clearly a better choice over other recent tree-based data structures like FAST and B+-trees. However, ART was not the first adaptive radix tree. To the best of our knowledge, the first was the Judy Array (Judy for…Expand
Efficient Processing of Range Queries in Main Memory
Cache-Sensitive Skip List: Efficient Range Queries on Modern CPUs
Parallelizing Approximate Search on Adaptive Radix Trees
S3: A Scalable In-memory Skip-List Index for Key-Value Store
START — Self-Tuning Adaptive Radix Tree
A Six-dimensional Analysis of In-memory Aggregation
Efficient indexing for big data in Hadoop MapReduce and main memory databases
Parallel Index-based Stream Join on a Multicore CPU
A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms
...
1
2
3
...

References

SHOWING 1-10 OF 19 REFERENCES
The adaptive radix tree: ARTful indexing for main-memory databases
Making B+- trees cache conscious in main memory
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Space Efficient Hash Tables with Worst Case Constant Access Time
Cuckoo hashing
A Reliable Randomized Algorithm for the Closest-Pair Problem
The art of computer programming: sorting and searching (volume 3)
Some Open Questions Related to Cuckoo Hashing
...
1
2
...