lightweight_trie
String store
A compact data structure for efficiently storing and retrieving strings
A very memory-efficient trie (radix tree) implementation
47 stars
2 watching
6 forks
Language: Java
last commit: over 12 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A generic abstraction layer over lightweight data storage and persistence | 623 |
| A data structure implementation for efficient approximate string matching and retrieval. | 9 |
| A lightweight JavaScript library for storing and manipulating JSON data on the client-side. | 2,132 |
| A Java API wrapper around the ultra-fast and compact key-value data store developed by Symas for the OpenLDAP Project. | 204 |
| A lightweight, modular key-value pair store designed to consume minimal resources and produce compact databases | 71 |
| A Rust library implementing a data storage format for multidimensional arrays and metadata | 119 |
| A triple store for RDF, OWL, and SPARQL written in Java | 59 |
| A lightweight Vue.js component for creating rich-text editors with two-way data binding and auto-save functionality. | 244 |
| A lightweight, RESTful database engine based on stack data structures | 206 |
| An embeddable key-value store with fast read performance and compact storage size | 939 |
| A C++ implementation of a trie data structure with benchmarks and tests. | 12 |
| A C++ implementation of a fast and memory-efficient data structure for storing strings by compressing common prefixes. | 796 |
| A distributed in-memory graph store that supports SPARQL select queries. | 31 |
| Utilities to simplify accessing application storage in client browsers | 11 |
| A Rust implementation of a ternary search tree data structure used for efficient string matching and lookup. | 23 |