CellarBoss provides a simple way to manage your wine cellar. It lets you easily update your database and includes printable reports. It uses an embedded Derby database so no separate database server is needed. The reports are created using Jasper Reports and can be printed and saved in many formats including PDF, HTML, Open Document, and XLS.
RedBeanPHP is a zero-config, easy-to-use object database for PHP and an ORM tool. It works very simply. Just create bean objects and throw them at RedBean. RedBean will analyze your objects and infer a readable, comfortable data scheme from it and create all required tables and columns on the fly. RedBean is not schemaless, it makes neat tables and columns for you, but on the fly without any configuration.
The ZODB is an object database that allows for comparably natural storage of Python objects. Its top features are transparent persistence for Python objects, full ACID-compatible transaction support (including savepoints), a history/undo ability, efficient support for binary large objects (BLOBs), pluggable storage, and a scalable architecture. The database has a proven track record for about ten years in large applications.
ExportSpreadsheets is a class that can be used to create an Excel spreadsheet from data in a MySQL table. It performs a query to a given MySQL table and creates an Excel spreadsheet file using the PEAR Spreadsheet_Excel_Writer package. The class can export multiple worksheets to a single Excel file. Several parameters may be used to configure details like which table fields map to which spreadsheet columns, field sorting, etc.
OrientDB is a NoSQL DBMS which can store 150,000 documents per second on common hardware. Even with a document-based database, the relationships are managed as in graph databases, with direct connections among records. You can traverse entire or parts of trees and graphs of records in a few milliseconds. It supports schema-less, schema-full, and schema-mixed modes, has a strong security profiling system based on users and roles, and supports SQL between the query languages. Thanks to the SQL layer, it's straightforward to use for people skilled in the relational world.
Orient Key/Value Server is based on the Document Database technology and is accessible as an embedded repository via Java APIs or via HTTP using a RESTful API. It uses a new algorithm called RB+Tree, derived from the Red-Black Tree to maintain tree balance, and from the B+Tree storing the links to records in pages to optimize memory consumption and loading time. Orient Key/Value Server scales out very well in a cluster with thousands of running machines: Orient will divide the load among all the nodes. Clustering, by default, works in auto-discovery mode: when a node starts, it attaches itself to the cluster if one is available. When a node goes down, the cluster automatically rebalances itself.
The goal of Funani is to solve the management of large image and other media collections in a practical way. To help you find the data you want in big data collections, this software allows you to sort it in many different ways. Advanced queries on dates, locations, events, or people, or more generically categories and tags, allow you to narrow the search quickly. Funani can be thought of primarily as a safe. Every file put into the system remains in the system. It is an additive system, which makes unintended deletion impossible. A maintenance mode can still remove unwanted files, but standard users cannot perform this operation. Funani is also a framework designed for extensibility. When new features are requested, they can be implemented by adding new functionality and leaving the existing system alone. Each feature is completely isolated from others as long as it does not depend on them.
The stx::CBTreeDB is a collection of C++ classes with which read-only key-value database files can be created and read. A database efficiently maps a large number of integral fixed-length keys to opaque binary value blobs. Variable-length or duplicate keys are currently not supported. Keys are organized into a highly compact index structure, which is very similar to a B-tree and allows very fast key lookups. Both keys and values are stored in order and thus queries in a local proximity can benefit from caching effects. All applications mapping a large number of constant, integral keys to string or data blobs can benefit from this library.