libart
Radix tree library
A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases.
Adaptive Radix Trees implemented in C
775 stars
29 watching
137 forks
Language: C
last commit: almost 3 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| An ANSI C implementation of a radix tree data structure | 1,127 |
| A data structure implementation that combines the efficiency of hash tables with the sorted order of tries, optimized for fast search and insertion operations. | 375 |
| Implementation of a Radix Tree data structure for efficient path-based routing and lookup in a programming language. | 102 |
| A high-performance data structure for efficient spatial indexing and querying of multi-dimensional data | 59 |
| A library implementing an adaptive radix tree data structure to store and match routes for routing and filtering purposes. | 259 |
| A fast string sorting algorithm implemented in Go. | 192 |
| A high performance C implementation of a self-balancing binary search tree | 99 |
| Provides an implementation of radix sort in C and C++ with various optimization techniques. | 6 |
| Extracts individual trees from high-density lidar point clouds using machine learning and computer vision techniques | 216 |
| A C++ implementation of spatial indexing algorithms | 716 |
| A lightweight C++ library for building distributed systems with messaging and serialization capabilities | 101 |
| An interprocess dlsym() implementation for OS X and iOS allowing lookup of local and remote symbols. | 176 |
| A utility for processing input lines with pattern matching support | 504 |
| A C++ header-only library for efficiently encoding and decoding spatial coordinates using the Morton order | 600 |
| A Pythonic library for semantic tree segmentation from aerial imagery | 243 |