C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
-
Updated
Jul 23, 2024 - C++
#
count-min-sketch
Here are 6 public repositories matching this topic...
Some advanced data structures' implementations in C++
bloom-filters cpp trie dynamic-table red-black-tree count-min-sketch interval-tree binomial-heap segment-tree b-tree advanced-data-structures rb-tree b-tree-implementation binary-counter amortized-analysis multipop-stack b-tree-cpp
-
Updated
Dec 12, 2022 - C++
PoC (Proof of Concept) caching optimization algorithm for graphical tree environment, written entirely in pure C++.
caching tree algorithm cplusplus cpp optimization dfs count-min-sketch tree-structure bfs optimization-algorithms dfs-algorithm bfs-algorithm heavy-hitters
-
Updated
Sep 23, 2019 - C++
-
Updated
Apr 22, 2019 - C++
My Thesis on the data structure Count-Min Sketch and it's applications.
caching data-structures count-min-sketch optimization-algorithms dfs-algorithm bfs-algorithm probabilistic-data-structures heavy-hitters
-
Updated
Nov 13, 2021 - C++
Improve this page
Add a description, image, and links to the count-min-sketch topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the count-min-sketch topic, visit your repo's landing page and select "manage topics."