Ternary Search Trees

Brought to you by: jerry2yu

Last Update: 2013-04-24

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

Earn up to 16% annual interest with Nexo.

Access competitive interest rates on your digital assets.

Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.

Get started with Nexo.

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

ssdeep
Recursive computing and matching of Context Triggered Piecewise Hashing (aka Fuzzy Hashing). Supports Windows, *nix, BSD, OS X, etc.
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.
Ternary Search Tree
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com
libhash
Libhash provides a clean and efficient C interface for chained hashing. It addition to the normal functions, libhash supports generalized keys, iteration over keys, values, and entries, and allows user control over memory use and hashing functions.
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.