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

$300 in Free Credit Towards Top Cloud Services

Build VMs, containers, AI, databases, storage—all in one place.

Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.

Get Started

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

$300 in Free Credit Towards Top Cloud Services

Build VMs, containers, AI, databases, storage—all in one place.

Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.

Get Started

Recommended Projects

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.
Cryptkeeper
Cryptkeeper Secuirty tool
Node Argon2
Node.js bindings for Argon2 hashing algorithm
smalt
A mapper for DNA sequencing reads