A crazy fast HTTP router

PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete

Router implementation for fasthttp

A high performance, zero-copy URL router.

Trie key-value database

An easy-to-use web framework. Supports both WSGI and ASGI modes. Gevent or asyncio, this is the question.

A generic patricia trie (also called radix tree) implemented in Go (Golang)

STL like container of radix tree (a.k.a. PATRICIA trie) in C++

high performance router for Koa

Radix Tree implementation for Crystal

A timed adaptive radix trie data-structure, used in SurrealKV

A simple, light and fast Web framework written in Go.

An Adaptive Radix Tree (ART) implementation in Go

Embedded persistent key-value store for .NET. Pure C# code.

A lightweight and fast router for PHP

Sorted Data Structure Server - Treds is a Data Structure Server which returns data in sorted order and is the fastest prefix search server. It also persists data on disk.

Golang radix tree implementation

go-fasttld is a high performance effective top level domains (eTLD) extraction module.

This example project demonstrates a clean way to architect an Android application.

adaptive radix tree (a.k.a prefix tree or compact trie)