Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Berkeley DB

Compare

  Analyzed about 1 year 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 ... [More] simultaneous threads of control or concurrent processes manipulating databases as large as 256 terabytes, on a wide variety of systems including most UNIX-like and Windows systems as well as real-time operating systems. [Less]

0 lines of code

0 current contributors

0 since last commit

61 users on Open Hub

Activity Not Available
4.0
   
I Use This
Mostly written in language not available
Licenses: sleepycat

leveldb

Compare

  Analyzed about 19 hours 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) ... [More] , Get(key), Delete(key). * Multiple changes can be made in one atomic batch. * Users can create a transient snapshot to get a consistent view of data. * Forward and backward iteration is supported over the data. * Data is automatically compressed using the Snappy compression library. * External activity (file system operations etc.) is relayed through a virtual interface so users can customize the operating system interactions. [Less]

21.8K lines of code

15 current contributors

9 days since last commit

7 users on Open Hub

Low Activity
3.0
   
I Use This

M2Collections

Compare

  Analyzed 7 months 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 ... [More] retrieved by reference or by copy, with built-in reference counting. All other ADTs allow data to be stored and retrieved by reference only. The library follows PIM4, it has no dependencies and it is platform independent. The library is tested with GM2 using option 'fpim4'. Under development. BSD style license. [Less]

1.74K lines of code

0 current contributors

almost 6 years since last commit

5 users on Open Hub

Activity Not Available
5.0
 
I Use This

Lightning Database

Compare

  Analyzed about 1 year 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 ... [More] library. It is developed under the OpenLDAP Project but is also usable on its own. [Less]

10.8K lines of code

4 current contributors

over 1 year since last commit

4 users on Open Hub

Activity Not Available
5.0
 
I Use This

Tokyo Cabinet

Compare

  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.

0 lines of code

0 current contributors

0 since last commit

2 users on Open Hub

Activity Not Available
5.0
 
I Use This
Mostly written in language not available
Licenses: No declared licenses

digidis

Compare

  Analyzed about 1 year ago

This is my redis client library for D. Compatible with D1/Tango and D2/Phobos.

0 lines of code

0 current contributors

0 since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This
Mostly written in language not available
Licenses: BSD-3-Clause

KVSlib

Compare

  Analyzed 7 months 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. ... [More] Requires C99, no dependencies, platform independent. BSD style license. [Less]

706 lines of code

0 current contributors

about 11 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This

cachelot

Compare

  Analyzed about 1 hour ago

Memcached compatible LRU cache library and distributed caching server. Cachelot has very small memory footprint and it is highly optimized. See benchmark charts on cachelot.io

7.99K lines of code

2 current contributors

4 months since last commit

1 users on Open Hub

Very Low Activity
0.0
 
I Use This

pmemkv

Compare

  Analyzed about 4 hours ago

Key/Value Datastore for Persistent Memory

35.4K lines of code

16 current contributors

1 day since last commit

0 users on Open Hub

High Activity
0.0
 
I Use This