cedar

v 2022-03-18 Updated: 2 years, 4 months ago

C++ implementation of efficiently-updatable double-array library

Cedar implements a double-array trie. It offers fast update/lookup for skewed (or ordered) queries; it is meant for skewed update/lookup with real-world data, e.g., words in natural language text or mining conjunctive features in a linear classifier. Even if keys are uniformly, randomly queried, its update/lookup is still faster than std::map and comparable to std::unordered_map.

Cedar implements a double-array trie. It offers fast update/lookup for skewed (or ordered) queries; it is meant for skewed update/lookup with real-world data, e.g., words in natural language text or mining conjunctive features in a linear classifier. Even if keys are uniformly, randomly queried, its update/lookup is still faster than std::map and comparable to std::unordered_map.

+ Show more

http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/cedar/