go-adaptive-radix-tree
Radix Tree
A data structure implementation that combines the efficiency of hash tables with the sorted order of tries, optimized for fast search and insertion operations.
Adaptive Radix Trees implemented in Go
375 stars
9 watching
56 forks
Language: Go
last commit: about 1 month ago
Linked from 2 awesome lists
gotrie
Related projects:
Repository | Description | Stars |
---|---|---|
armon/libart | A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 775 |
antirez/rax | An ANSI C implementation of a radix tree data structure | 1,127 |
api7/lua-resty-radixtree | A library implementing an adaptive radix tree data structure to store and match routes for routing and filtering purposes. | 259 |
luislavena/radix | Implementation of a Radix Tree data structure for efficient path-based routing and lookup in a programming language. | 102 |
tidwall/rtree | An in-memory R-tree implementation designed for fast spatial searching and indexing | 316 |
viant/ptrie | A Go library implementing a fast and efficient prefix tree data structure for storing and retrieving key-value pairs in various formats. | 41 |
s0rg/quadtree | A data structure implementation that efficiently stores and retrieves spatial locations using a quadtree algorithm. | 37 |
rtanno21609/adaptiveneuraltrees | An implementation of Adaptive Neural Trees in PyTorch for deep learning | 151 |
arl/go-rquad | A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. | 134 |
sgrodriguez/ddt | A Go-based decision tree library allowing custom rule-based decision making | 37 |
igrigorik/decisiontree | An implementation of the ID3 algorithm for building decision trees | 1,438 |
sbourlon/go-lctree | Provides data structures and utilities for serializing and deserializing LeetCode-style binary trees | 4 |
crusj/hierarchy-tree-go.nvim | Displays call chains and hierarchical relationships in Go source code | 31 |
talgalili/dendextend | A package extending R's dendrogram functionality with missing features. | 153 |
jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |