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

Gemini 3 and 200+ AI Models on One Platform

Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.

Start Free

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

Gemini 3 and 200+ AI Models on One Platform

Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.

Start Free

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.
ssdeep
Recursive computing and matching of Context Triggered Piecewise Hashing (aka Fuzzy Hashing). Supports Windows, *nix, BSD, OS X, etc.
dcfldd
An Enhanced version of gnu dd with features useful for forensics and security. Key features include on-the-fly hashing, status output and faster disk wiping.
Eristic Cryptographic Toolkit
Open source 8 bit random number generator
smalt
A mapper for DNA sequencing reads