What's the simplest method to simulate a database table by having an index inside a key value store? The important thing value store doesn't have ranged queries with no purchased secrets.

The items I wish to simulate (so as of priority):

  1. Create tables
  2. Add posts
  3. Create indexes
  4. Query according to primary key
  5. Query according to arbitrary posts

Make use of a hashtable or dictionary. If you would like unique key values you could utilize a GUID or hashcode.

If you are using Redis (a professional key-value store that supports strings, lists, sets, etc.) Than the isn't very difficult. I've already created a C# redis client which has native support for storing POCO's data models. These identical POCO's may be used by OrmLite to keep it inside a RDBMS.

Incidentally Redis is fast, I've got a benchmark that stores and retrieves the whole Northwind Database (3202 records) within 1.2 seconds (running in the UnitTest on the 3yo iMac).

I store organizations in 2 ways

  • Distinct organizations, where I mix the course type title and Primary Key to produce a unique key e.g. urn:user:1
    • Then i conserve a separate group of primary secrets (inside a Redis Set) to keep an eye on my organizations, utilizing a key like: ids:user
  • Inside a Redis server side list - which functions greatly just like a table with support for paging, utilizing a key like: lists:user

The important thing-value store should support ordering the secrets and ranged accessibility secrets.

Then you definitely should create two dictionaries:

id -> payload

and

col1, id -> NULL

, where payload should contain all of the data the database table would contain, and also the secrets from the second dictionary should retain the values of (col1, id) from each entry from the first dictionary.