Ports Search

DBIx::TransactionManager is a simple transaction manager. Like DBIx::Class::Storage::TxnScopeGuard.

When you've got one of those nasty self-referential tables that you want to bust out into a tree, this is the module to check out. Assum- ing there are no horribly broken nodes in your tree and (heaven forbid) any circular references Philip M. Gollucci <philip@p6m7g8.com>

DBIx::VersionedDDL is a perl module to upgrade and downgrade database schemas to a specified version.

This is the DBIx::Wrapper module -- a convenience wrapper around Perl's DBI.

A unique flat-file database module, written in pure perl. True multi-level hash/array support (unlike MLDBM, which is faked), hybrid OO / tie() interface, cross-platform FTPable files, and quite fast. Can handle millions of keys and unlimited hash levels without significant slow-down. Written from the ground-up in pure perl -- this is NOT a wrapper around a C-based DBM. Out-of-the-box compatibility with Unix, Mac OS X and Windows.

DWH_File is used in a similar manner to NDBM_File, DB_File etc. In fact it depends on one of these. DWH_File expands the functionality to save not only the hash that is tied but also all the data that this hash contains references to - that is it'll save all you list of lists and list of hashes and so forth. And what's more, it will save objects as well - if they'll comply with some very simple rules which don't impose any limitations to their functionality or structure except that they can't themselves be tied to anyone else. See the "Models" section of the embedded documentation for details.

Peter Graf's Program Base Library of C functions. Includes hash table, ISAM, key file implementations.

LuaDBI is a database interface library for Lua. It is designed to provide a RDBMS agnostic API for handling database operations.

DataStax Cpp Driver is modern, feature-rich, and highly tunable C/C++ client library for Apache Cassandra (1.2+) and DataStax Enterprise (3.1+) using exclusively Cassandra's native protocol and Cassandra Query Language v3.

When searching through large amounts of data, it is often the case that a result set is returned that is larger than we want to display on one page. This results in wanting to page through various pages of data. The maths behind this is unfortunately fiddly, hence this module. The main concept is that you pass in the number of total entries, the number of entries per page, and the current page number. You can then call methods to find out how many pages of information there are, and what number the first and last entries on the current page really are.