PyMySQL is a pure-Python MySQL client library, based on PEP 249. Most public APIs are compatible with mysqlclient and MySQLdb.

SQLiteStudio is desktop application for browsing and editing SQLite database files. It is aimed for people, who know what SQLite is, or what relational databases are in general.

This Python package provides an API to execute meta-commands (AKA "special", or "backslash commands") on PostgreSQL.

UnQLite is an in-process software library which implements a self-contained, serverless, zero-configuration, transactional NoSQL database engine. UnQLite is a document store database similar to Redis, CouchDB, etc., as well as a standard key/value store similar to BerkeleyDB, LevelDB, etc.

MyCLI is a command line interface for MySQL, MariaDB, and Percona with auto-completion and syntax highlighting.

The goal for nanodbc is to make developers happy by providing a simpler and less verbose API for working with ODBC. Common tasks should be easy, requiring concise and simple code.

Soufflé is a variant of Datalog for tool designers crafting analyses in Horn clauses. Soufflé synthesizes a native parallel C++ program from a logic specification. The Soufflé language is similar to Datalog (but has terms known as records), and is frequently used as a domain-specific language for analysis problems.

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.

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.

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

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.

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.

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

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.

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.

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.

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.

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.

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.

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

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.

parallel-hashmap provides a family of header-only, very fast and memory-friendly hashmap and btree containers for C++11 and above.

It has the following characteristics:

• Drop-in replacement for std::unordered_map, std::unordered_set, std::map, and std::set with better performance.

• Requires C++11 compiler support and provides C++14 and C++17 APIs, including features like try_emplace.

• Highly efficent and faster than standard unordered containers, Boost implementations, or sparsepp alternatives.

• Memory-friendly: maintains low memory usage with a slight increase compared to sparsepp.

• Heterogeneous lookup support.

• Dump/load feature: for flat hash maps storing std::trivially_copyable data, the entire table can be dumped to disk and restored as a single array efficiently without hash computations. This is about 10 times faster than element-wise serialization but uses 10% to 60% extra disk space.

• Automatic support for boost::hash_value() and default hash functions for std::pair and std::tuple.

Radicale is a CalDAV and CardDAV server for UNIX-like platforms. Calendars and address books are available for both local and remote access, possibly limited through authentication policies. They can be viewed and edited by calendar and contact clients on mobile phones or computers.

Radicale intentionally does not fully comply with the CalDAV and CardDAV RFCs. Instead, it supports the CalDAV and CardDAV implementations of popular clients.