A graph-based distributed in-memory store that leverages efficient graph exploration to provide highly concurrent and low-latency queries over big linked data
-
Updated
Jul 28, 2022 - C++
#
low-latency-queries
Here are 2 public repositories matching this topic...
A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per second.
fast
caching
benchmark
memoization
cpp
high-performance
cache
lru
data-structures
low-latency
fastest
high-throughput
lru-cache
cache-simulator
multi-level-cache
low-latency-queries
least-recently-used
set-associative-cache
direct-mapped-cache
clock-second-chance
-
Updated
Jan 18, 2024 - C++
Improve this page
Add a description, image, and links to the low-latency-queries topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the low-latency-queries topic, visit your repo's landing page and select "manage topics."