InfiniSQL is a distributed in-memory NewSQL relational database management system (RDBMS). It excels at performing complex transactions which involve records on multiple server nodes. It is engineered around the actor model of concurrent programming, which enables unique scalability capabilities.
RecDB is a recommendation engine built entirely inside PostgreSQL 9.2. It allows application developers to build recommendation applications using a wide variety of built-in recommendation algorithms such as user-user collaborative filtering, item-item collaborative filtering, and singular value decomposition. Applications powered by RecDB can produce online and flexible personalized recommendations to end-users. It is easily used and configured and allows novice developers to define a variety of recommenders that fits their application's needs in few lines of SQL. It can seamlessly integrate recommendation functionality with traditional database operations.
SqliteJdbcNG is a JDBC driver for SQLite. The overall goal of this project is to start a fresh implementation that leverages newly available technologies in the Java world. For example, any SQLite driver for any language must integrate with the native SQLite library. All of the current Java implementations rely on a custom JNI library to call out to the SQLite library. This extra layer can easily create a headache for the development and deployment of the driver, since it needs to be built for a variety of operating systems. Fortunately, there are technologies like Bridj and JNA that can be used to call native code directly from Java. By leaving the majority of the headaches of integrating with the native library to the Bridj project, more time can be spent on making a high quality driver that is more compliant with the JDBC4 spec.
cola is a C implementation of the COLA structure described in the paper "Cache Oblivious Streaming B-Trees" by Bender, Farach-Colton, et al. This algorithm is a drop-in replacement for B-Tree databases/indexes which performs faster on spinning disks than B-Trees do on SSD. It's asymptotically optimal in terms of data transfers to and from disk. For example, random key inserts are turned into linear sequential writes while maintaining the property which queries always require, at most, precisely log N blocks read sequentially (but not contiguously) from disk (or half that, on average).
epers stands for "Erlang persistence". As the name suggests, it tries to make it easy to use databases in Erlang programs, to make the language a little more agile, and (humbly) offer a nice adapter for several databases, hiding their implementation details (and the API of the library/framework/driver used to communicate with them). To achieve this, it aims to offer a somewhat consistent API to define and work with your model, while at the same not coupling your code too tightly to it.
pgFormatter is a SQL formatter/beautifier which supports keywords from SQL-92, SQL-99, SQL-2003, SQL-2008, and SQL-2011, and PostgreSQL-specific keywords. It can work as a console program or as a CGI system. It will automatically detect its environment and output as text or as HTML according to the context.
The YB.ORM library aims to simplify writing C++ code that has to deal with SQL databases. The goal is to provide a convenient interface like SQLAlchemy (Python) or Hibernate (Java). The library itself is cross-platform and supports a variety of SQL dialects: SQLite3, MySQL, Postgres, Oracle, and Firebird. Integration with Boost, Qt4, and wxWidgets is built-in. In a typical usage scenario, you would describe your database schema and table relationships in a simple XML-based format, generate SQL code to populate database schema with tables, generate C++ classes, add application-specific logic to the classes, and use these classes in cooperation with the Session object to query objects from the database, create new or modify/delete existing objects, or link and unlink objects using relations. Simple serialization to XML is supported along with connection pooling.