Select a tag to browse associated projects and drill deeper into the tag cloud.
memcached
Analyzed over 2 years ago
memcached is a high-performance, distributed memory object caching system, generic in nature, but intended for use in speeding up dynamic web applications by alleviating database load.
Licenses:
BSD-3-Clause
Berkeley DB
Analyzed over 2 years ago
Berkeley DB (BDB) is a high-performance, embedded database library with bindings in C, C++, Java, Perl, Python, Tcl, Smalltalk and many other programming languages. BDB stores arbitrary key/data pairs as byte arrays, and supports multiple data items for a single key. BDB can support thousands of
Mostly written in language not available
Licenses:
sleepycat
riak
R
Analyzed over 2 years ago
Riak combines a decentralized key-value store, a flexible map/reduce engine, and a friendly HTTP/JSON query interface to provide a database ideally suited for Web applications.
Licenses:
apache_2
leveldb
L
Analyzed 1 day ago
LevelDB is a library that implements a fast key-value store.
Features
* Keys and values are arbitrary byte arrays.
* Data is stored sorted by key.
* Callers can provide a custom comparison function to override the sort order.
* The basic operations are Put(key,value)
Licenses:
BSD-3-Clause
M2Collections
M
Analyzed almost 2 years ago
Modula-2 collections library. The library provides an API for collection ADTs, in particular: stacks, queues, double ended queues, priority queues, balanced binary search trees, patricia tries, dynamic arrays and hash tables to store arbitrary data. The hash table ADT allows data to be stored and
Lightning Database
Analyzed over 2 years ago
Lightning DB (aka MDB) is an ultra-high performance database using memory-mapped data. It is fully transactional with ACID guarantees and uses Multi-Version Concurrency Control and scales perfectly across large numbers of CPUs. It is also extremely compact, at only 35KB of object code for the
Licenses:
OpenLDAP_...
Tokyo Cabinet
T
No analysis available
Tokyo Cabinet is the successor of QDBM, a high performance database library similar to the DBM family. It also supports hash and B-tree databases and does not require any server process. The overall speed is improved compared to QDBM.
Mostly written in language not available
Licenses:
No declared licenses
digidis
D
Analyzed over 2 years ago
This is my redis client library for D. Compatible with D1/Tango and D2/Phobos.
Mostly written in language not available
Licenses:
BSD-3-Clause
KVSlib
K
Analyzed almost 2 years ago
C library for key-value storage. The library provides an API to create and use dynamic associative arrays for arbitrary data. Data may be stored and retrieved by copy or by reference. Stored data is reference counted to prevent dangling pointers. Optimised for fast lookups and large data sets.