Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/aminography/radixtree
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
https://github.com/aminography/radixtree
data-structures indexing prefix-search prefix-tree radix-tree radix-trie tree-structure
Last synced: 20 days ago
JSON representation
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
- Host: GitHub
- URL: https://github.com/aminography/radixtree
- Owner: aminography
- License: apache-2.0
- Created: 2021-02-15T08:56:09.000Z (about 4 years ago)
- Default Branch: master
- Last Pushed: 2021-12-29T11:25:53.000Z (about 3 years ago)
- Last Synced: 2024-12-04T22:17:58.397Z (3 months ago)
- Topics: data-structures, indexing, prefix-search, prefix-tree, radix-tree, radix-trie, tree-structure
- Language: Kotlin
- Homepage:
- Size: 114 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# `RadixTree` :zap:

[](https://www.codacy.com/gh/aminography/RadixTree/dashboard?utm_source=github.com&utm_medium=referral&utm_content=aminography/RadixTree&utm_campaign=Badge_Grade)This project provides an implementation of [`RadixTree`](https://en.wikipedia.org/wiki/Radix_tree) data-structure, which is a great tool for indexing a large number of records with string keys and performing a prefix search with an optimal time complexity.
Table of Contents
-----------------
- [Main Characteristics](#main-characteristics)
- [Complexity Order](#complexity-order)
Main Characteristics
--------------------
- Space and time efficient.
- Retrieves elements sorted, when elements insertion is sorted.
Complexity Order
--------------------
`RadixTree` or compressed trie is the compact and space-optimized form of prefix tree,
which enables us to find all nodes whose keys start with a prefix string, by a `O(L + V)` complexity order, where `L` is the length of input
prefix, and `V` stands for number of nodes that will be discovered.In case of large datasets, the length of keys are dramatically lower than number of items, which means that the time complexity of prefix search using `RadixTree` is significantly better than linear search.
Download
--------
**`RadixTree`** is available on `MavenCentral` to download using build tools systems.### • Gradle
Add the following lines to your `build.gradle` file:```gradle
dependencies {
implementation 'com.aminography:radixtree:1.2.0'
}
```### • Maven
Add the following lines to your `pom.xml` file:```xml
com.aminography
radixtree
1.2.0
```