/madras-trie

A compact static dictionary based on Ext-LOUDS Patricia Trie structure

Primary LanguageC++BSD 3-Clause "New" or "Revised" LicenseBSD-3-Clause

Madras Sorcery Trie

Madras Sorcery stands for Matching algorithms with densely-packed rank-stacked succinct trie with Space Optimised Row Columnar Encoding-driven Resource Yielding database format.

It is a compact static database based on Ext-LOUDS Patricia Trie structure and highly compacted Columnar database format.

This library is under construction and not available for use yet.