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

The drivers officially supported by libdbi are:

• MySQL,

• PostgreSQL,

• SQLite.

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.

The MariaDB Connector/C is used to connect applications developed in C/C++ to MariaDB and MySQL databases.

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

SQLAlchemy is the Python SQL toolkit and ORM that gives application developers the full power and flexibility of SQL. It provides a full suite of well known enterprise-level persistence patterns, designed for efficient and high-performing database access, adapted into a simple and Pythonic domain language.

python-sql is a library to write SQL queries, that transforms idiomatic python function calls to well-formed SQL queries.

pgloader is a program that can load data or migrate databases from CSV, DB3, iXF, SQLite, MS-SQL or MySQL to PostgreSQL.

This module was inspired by the excellent DBIx::Abstract. While based on the concepts used by DBIx::Abstract, the concepts used have been modified to make the SQL easier to generate from Perl data structures. The underlying idea is for this module to do what you mean, based on the data structures you provide it, so that you don't have to modify your code every time your data changes.

dicedb is a fast, reactive, in-memory database optimized for modern hardware. Commonly used as a cache, it offers a familiar interface while enabling real-time data updates through query subscriptions. It delivers higher throughput and lower median latencies, making it ideal for modern workloads.

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.

This module is nearly identical to SQL::Abstract 1.81, and exists to preserve the ability of users to opt into the new way of doing things in later versions according to their own schedules.

It is an abstract SQL generation module based on the concepts used by DBIx::Abstract, with several important differences, especially when it comes to WHERE clauses. These concepts were modified to make the SQL easier to generate from Perl data structures.

The underlying idea is for this module to do what you mean, based on the data structures you provide it. You shouldn't have to modify your code every time your data changes, as this module figures it out.

Apache Arrow is a columnar in-memory analytics layer designed to accelerate big data. It houses a set of canonical in-memory representations of flat and hierarchical data along with multiple language-bindings for structure manipulation. It also provides IPC and common algorithm implementations.

pg_tmp creates temporary PostgreSQL databases, suitable for tasks like running software test suites. Temporary databases created with pg_tmp have a limited shared memory footprint and are automatically garbage-collected after a configurable number of seconds (the default is 60).

Tortoise ORM is an easy-to-use asyncio ORM (Object Relational Mapper) inspired by Django. Tortoise ORM was built with relations in mind and admiration for the excellent and popular Django ORM. It's engraved in its design that you are working not with just tables, you work with relational data.

SQL::Tokenizer is a tokenizer for SQL queries. It does not claim to be a parser or query verifier. It just creates sane tokens from a valid SQL query.

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.

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.

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.

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.

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