This package provides aerich, a Python database migrations tool for Tortoise ORM. It can be used both programmatically or as a standalone CLI application.

Pypika-tortoise is a fork of pypika which has been streamlined for its use in the context of tortoise-orm. It removes support for many database kinds that tortoise-orm doesn't need, for example.

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 module creates a temporary SQLite database, deploys a DBIC schema, and then connects to it. This lets you easily test DBIC schema. Since you have a fresh database for every test, you don't have to worry about cleaning up after your tests, ordering of tests affecting failure, etc.

Firebird is an SQL RDBMS with rich support for ANSI SQL (e.g., INSERT...RETURNING) including UDFs and PSQL stored procedures, cursors, and triggers. Transactions provide full ACID-compliant referential integrity.

The database requires very little manual maintenance once set up, making it ideal for small business or embedded use.

When installed as a traditional local or remote (network) database server, Firebird can grow to terabyte scale with proper tuning---although PostgreSQL may be a better choice for such very large environments.

Firebird can also be embedded into stand-alone applications that don't want or need a full client & server. Used in this manner, it offers richer SQL support than SQLite as well as the option to seamlessly migrate to a client/server database later.

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

Prisma Client Python is an auto-generated and fully type-safe database client.

The Lightning Memory-Mapped Database (LMDB) is a high-performance transactional database. Unlike more complex relational databases, LMDB handles only key-value pairs (stored as arbitrary byte arrays) and relies on the underlying operating system for caching and locking, keeping the code small and simple. The use of ‘zero-copy’ memory-mapped files combines the persistence of classic disk-based databases with high read performance that scales linearly over multiple cores. The size of each database is limited only by the size of the virtual address space — not physical RAM.

This package provides a utility for dumping the contents of an ElasticSearch index to a compressed file and restoring the dumpfile back to an ElasticSearch server

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.

PickleShare is a small ‘shelve’-like datastore with concurrency support. Like shelve, a PickleShareDB object acts like a normal dictionary. Unlike shelve, many processes can access the database simultaneously. Changing a value in database is immediately visible to other processes accessing the same database. Concurrency is possible because the values are stored in separate files. Hence the “database” is a directory where all files are governed by PickleShare.

Alembic is a lightweight database migration tool for usage with the SQLAlchemy Database Toolkit for Python.

The libdbi-drivers library provides the database specific drivers for the libdbi framework.

The drivers officially supported by libdbi are:

• MySQL,

• PostgreSQL,

• SQLite.

This package is a Sphinx extension providing additional coroutine-specific markup.

Because the many-to-many relationships are not real relationships, they can not be introspected with DBIx::Class. Many-to-many relationships are actually just a collection of convenience methods installed to bridge two relationships. This DBIx::Class component can be used to store all relevant information about these non-relationships so they can later be introspected and examined.

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

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

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

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.

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.

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.

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.

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.

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