Ternary Search Trees

Brought to you by: jerry2yu

Last Update: 2013-04-24

Get an email when there's a new version of Ternary Search Trees

Ternary search tree stores keys in sorted order, which can be used as a symbol table.
Searching operation is lightning fast, it is reported comparable with hashing table in most cases, and substantially faster than hashing for unsuccessful searches.

Project Activity

See All Activity >

Follow Ternary Search Trees

Ternary Search Trees Web Site

Other Useful Business Software

Get the most trusted enterprise browser

Advanced built-in security helps IT prevent breaches before they happen

Defend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.

Download Chrome

Rate This Project

User Reviews

Be the first to post a review of Ternary Search Trees!

Additional Project Details

Registered

2006-01-24

Report inappropriate content

Recommended Projects

sgrep (sorted grep)
Sgrep (sorted grep) is a much faster alternative to traditional Unix grep when searching large files, because sgrep searches sorted input files using a fast binary search to find matching lines.
Buckets
A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted...
zld
For large projects, the linking phase (explanation) can significantly increase incremental build times. This project is a fork of the Apple linker, ld. It is a drop-in replacement that can substantially speed things up. It all depends on your risk tolerance and how much you value the speedup in...
Meilisearch
An open-source, lightning-fast, and hyper-relevant search engine that fits effortlessly into your apps, websites, and workflow. Meilisearch is a flexible and powerful user-focused search engine that can be added to any website or application. Search-as-you-type returns answers in less than 50...
LRSTAR parser generator for C++
An LALR(1) and LALR(*) parser generator. Generates parsers up to 140 times the speed of ANTLR parsers, and 1/10th of the size or smaller. Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table....