Editing Radix tree (section)

==External links==
{{Commons category}}
*[http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/PATRICIA/ Algorithms and Data Structures Research & Reference Material: PATRICIA], by Lloyd Allison, [[Monash University]]
*[https://xlinux.nist.gov/dads/HTML/patriciatree.html Patricia Tree], [[NIST Dictionary of Algorithms and Data Structures]]
*[http://cr.yp.to/critbit.html  Crit-bit trees], by [[Daniel J. Bernstein]]
*[https://lwn.net/Articles/175432/ Radix Tree API in the Linux Kernel], by Jonathan Corbet
*[http://code.dogmap.org/kart/ Kart (key alteration radix tree)], by Paul Jarc
*[https://db.in.tum.de/~leis/papers/ART.pdf The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases], by Viktor Leis, [[Alfons Kemper]], [[Thomas Neumann]], [[Technical University of Munich]]

===Implementations===
*[http://bxr.su/f/sys/net/radix.h FreeBSD Implementation], used for paging, forwarding and other things.
*[https://git.kernel.org/cgit/linux/kernel/git/torvalds/linux.git/tree/lib/radix-tree.c Linux Kernel Implementation], used for the page cache, among other things.
*[https://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/trie_based_containers.html GNU C++ Standard library has a trie implementation]
*[https://code.google.com/p/concurrent-trees/ Java implementation of Concurrent Radix Tree], by Niall Gallagher
*[http://paratechnical.blogspot.com/2011/03/radix-tree-implementation-in-c.html C# implementation of a Radix Tree]
*[https://code.google.com/p/patl/ Practical Algorithm Template Library], a C++ library on PATRICIA tries (VC++ >=2003, GCC G++ 3.x), by Roman S. Klyujkov
*[http://www.codeproject.com/KB/string/PatriciaTrieTemplateClass.aspx Patricia Trie C++ template class implementation], by Radu Gruian
*[https://hackage.haskell.org/package/containers/docs/Data-IntMap-Internal.html Haskell standard library implementation] "based on big-endian patricia trees". Web-browsable [https://hackage.haskell.org/package/containers/docs/src/Data.IntMap.Internal.html source code].
*[https://github.com/rkapsi/patricia-trie Patricia Trie implementation in Java], by Roger Kapsi and Sam Berlin
*[https://github.com/agl/critbit Crit-bit trees] forked from C code by Daniel J. Bernstein
*[http://cprops.sourceforge.net/gen/docs/trie_8c-source.html Patricia Trie implementation in C], in [http://cprops.sourceforge.net libcprops]
*[https://usr.lmf.cnrs.fr/~jcf/ftp/ocaml/ds/ Patricia Trees : efficient sets and maps over integers (module ptmap)] in [[OCaml]], by Jean-Christophe Filliâtre
*[https://github.com/balena/radixdb Radix DB (Patricia trie) implementation in C], by G. B. Versiani
*[https://github.com/armon/libart Libart - Adaptive Radix Trees implemented in C], by Armon Dadgar with other contributors (Open Source, BSD 3-clause license)
*[https://nim-lang.org/docs/critbits.html Nim implementation of a crit-bit tree]
*[https://github.com/antirez/rax rax], a radix tree implementation in ANSI C by [[Salvatore Sanfilippo]] (the creator of [https://redis.io/ REDIS])

{{CS-Trees}}

[[Category:Trees (data structures)]]
[[Category:String data structures]]