DBIx::Simple provides a simplified interface to DBI, Perl's powerful database module. This module is aimed at rapid development and easy maintenance. Query preparation and execution are combined in a single method, the result object (which is a wrapper around the statement handle) provides easy row-by-row and slurping methods.

This package provides a Python interface to the Redis key-value store.

PyPika is a python SQL query builder that exposes the full richness of the SQL language using a syntax that reflects the resulting query.

The DB::File module provides Perl bindings to the Berkeley DB version 1.x.

Redis is an advanced key-value cache and store. Redis supports many data structures including strings, hashes, lists, sets, sorted sets, bitmaps and hyperloglogs.

Package rdb implements parsing and encoding of the Redis RDB file format.

MDB Tools is a set of tools and applications to read the proprietary MDB file format used in Microsoft's Access database package. This includes programs to export schema and data from Microsoft's Access database file format to other databases such as MySQL, Oracle, Sybase, PostgreSQL, etc., and an SQL engine for performing simple SQL queries.

PostgreSQL is a powerful object-relational database system. It is fully ACID compliant, has full support for foreign keys, joins, views, triggers, and stored procedures (in multiple languages). It includes most SQL:2008 data types, including INTEGER, NUMERIC, BOOLEAN, CHAR, VARCHAR, DATE, INTERVAL, and TIMESTAMP. It also supports storage of binary large objects, including pictures, sounds, or video.

This package provides a Python interface to the Redis key-value store.

Perform basic numeric, textual and statistical operations on plain text files. Designed to work within standard pipelines without additional code.

Vnlog (pronounced vanillog) is a toolkit for manipulating tabular ASCII data with labelled fields using regular command-line tools.

The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations and heaps.

ssdeep computes and matches context triggered piecewise hashes (CTPH), also called fuzzy checksums. It can identify similar files that have sequences of identical bytes in the same order, even though bytes in between these sequences may be different in both content and length.

The Succinct Data Structure Library (SDSL) is a powerful and flexible C++11 library implementing succinct data structures. In total, the library contains the highlights of 40 research publications. Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical.

tllist is a typed linked list C header file only library implemented using pre-processor macros. It supports primitive data types as well as aggregated ones such as structs, enums and unions.

The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions.

Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function.

This library contains several hash-map implementations, similar in API to SGI's hash_map class, but with different performance characteristics. sparse_hash_map uses very little space overhead, 1-2 bits per entry. dense_hash_map is very fast, particularly on lookup. sparse_hash_set and dense_hash_set are the set versions of these routines. All these implementation use a hashtable with internal quadratic probing. This method is space-efficient -- there is no pointer overhead -- and time-efficient for good hash functions.

libdivsufsort is a software library that implements a lightweight suffix array construction algorithm. This library provides a simple and an efficient C API to construct a suffix array and a Burrows-Wheeler transformed string from a given string over a constant-size alphabet. The algorithm runs in O(n log n) worst-case time using only 5n+O(1) bytes of memory space, where n is the length of the string.

uthash implements a hash table and a few other basic data structures as C preprocessor macros. It aims to be minimalistic and efficient: it's around 1,000 lines of code which, being macros, inline automatically.

Unlike function calls with fixed prototypes, macros operate on untyped arguments. Thus, they are able to work with any type of structure and key. Any C structure can be stored in a hash table by adding UT_hash_handle to the structure and choosing one or more fields to act as the key.

liburcu is a user-space Read-Copy-Update (RCU) data synchronisation library. It provides read-side access that scales linearly with the number of cores. liburcu-cds provides efficient data structures based on RCU and lock-free algorithms. These structures include hash tables, queues, stacks, and doubly-linked lists.

MARISA is a static and space-efficient trie data structure C++ library.

libcuckoo provides a high-performance, compact hash table that allows multiple concurrent reader and writer threads.

Zix is a C library of portability wrappers and data structures. It provides the following components:

ZixAllocator A customizable allocator.

ZixBumpAllocator A simple realtime-safe bump-pointer allocator.

ZixBTree A page-allocated B-tree.

ZixHash An open-addressing hash table.

ZixRing A lock-free realtime-safe ring buffer.

ZixSem A portable semaphore wrapper.

ZixThread A portable thread wrapper.

ZixTree A binary search tree.

zixgest.h Digest functions suitable for hashing arbitrary data.

zix/filesystem.h Functions for working with filesystems.

zix/path.h Functions for working with filesystem paths lexically.

Coucal is an implementation of the Cuckoo hashing algorithm with a stash area using by default the MurmurHash hash function.