Comparison of trie implementations
Comparison of several trie implementations in Java.
This work has been inspired by the Trie implementation from Julien Lemoine based on backing arrays: http://wikipedia-clustering.speedblue.org/trieJava.php
Disk-based B+-tree written in Pure Java
Practical Algorithm to Retrieve Information Coded in Alphanumeric (PATRICIA)
深入理解Java集合框架
A simple PATRICIA Trie implementation that's more "hackable".
Demonstrate overheads for various Java Collection implementations.
Versatile sort algorithm implementations.
All Algorithms implemented in Java
A ConcurrentLinkedHashMap for Java
Fastest word count in Java
Everything you need to know to get the job.
Benchmark comparing serialization libraries on the JVM
An attempt to implement a concurrent hash-trie map in Java