From a97ed585e3e4e4115f0ca6f1f4e9cca9cfc3785d Mon Sep 17 00:00:00 2001 From: Gregory Eremin Date: Wed, 24 Sep 2014 20:29:27 +0400 Subject: [PATCH] In-memory database descriptions updated --- README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 61e4101..79ebd54 100644 --- a/README.md +++ b/README.md @@ -73,11 +73,11 @@ If you need a temporary in-memory storage use the following symbols as the `-sto | Value | Database Type | | ----- | ------------- | -| `-` | `ProtoHashDB` Prototype hash database. In-memory database implemented with `std::unorderd_map` | -| `+` | `ProtoTreeDB` Prototype tree database. In-memory database implemented with `std::map` | -| `:` | `StashDB` Stash database. In-memory database saving memory | -| `*` | `CacheDB` Cache hash database. In-memory database featuring [LRU](http://en.wikipedia.org/wiki/Cache_algorithms#Examples) deletion | -| `%` | `GrassDB` Cache tree database. In-memory database of B+ tree: cache with order | +| `-` | `ProtoHashDB` Prototype hash database implemented with `std::unorderd_map` | +| `+` | `ProtoTreeDB` Prototype tree database implemented with `std::map` | +| `:` | `StashDB` Stash database implemented with `kyotocabinet::TinyHashMap` | +| `*` | `CacheDB` Cache hash database that features [LRU](http://en.wikipedia.org/wiki/Cache_algorithms#Examples) deletion | +| `%` | `GrassDB` Cache tree database implemented using B+ tree ordered cache | #### Example: `-`