TinyCDB - a Constant DataBase     TinyCDB is a very fast and simple package for creating and reading constant data bases, a data structure introduced by Dan J. Bernstein in his cdb package. It may be used to speed up searches in a sequence of (key,value) pairs with very big number of records. Example usage is indexing a big list of users - where a search will require linear reading of a large /etc/passwd file, and for many other tasks. It's usage/API is similar to ones found in BerkeleyDB, gdbm and traditional *nix dbm/ndbm libraries, and is compatible in great extent to cdb-0.75 package by Dan Bernstein. CDB is a constant database, that is, it cannot be updated at a runtime, only rebuilt. Rebuilding is atomic operation and is very fast - much faster than of many other similar packages. Once created, CDB may be queried, and a query takes very little time to complete.     http://www.corpit.ru/mjt/tinycdb.html     tags: cdb tinycdb LucidDB Home Page     LucidDB is the first and only open-source RDBMS purpose-built entirely for data warehousing and business intelligence. It is based on architectural cornerstones such as column-store, bitmap indexing, hash join/aggregation, and page-level multiversioning. Most database systems (both proprietary and open-source) start life with a focus on transaction processing capabilities, then get analytical capabilities bolted on as an afterthought (if at all). By contrast, every component of LucidDB was designed with the requirements of flexible, high-performance data integration and sophisticated query processing in mind. Moreover, comprehensiveness within the focused scope of its architecture means simplicity for the user: no DBA required. Rather than throwing hardware at data warehousing problems by relying on expensive clusters or specialized "appliances", the scalability offered by LucidDB's unique architecture allows you to achieve great performance     http://www.luciddb.org/     tags: cdb columnstore rdbms column luciddb Benchmarking BDB, CDB and Tokyo Cabinet on large datasets     http://www.dmo.ca/blog/benchmarking-hash-databases-on-large-...     tags: cdb Tree-like Constant Database (tcdb)     http://www.unixuser.org/~euske/doc/tcdb/index.html     tags: cdb python Constant Database (cdb) Internals     Constant Database, known as cdb, is an elegant data structure proposed by D. J. Bernstein. It is suitable for looking up static data which is associated with arbitrary byte sequences (usually strings). Although DJB already explained this in his cdb page, it is not easy to implement this because his document lacks some important information such as the number of each subtable. Here I tried to illustrate it for those who try to develop or extend a cdb implementation.     http://www.unixuser.org/~euske/doc/cdbinternals/     tags: cdb pilcrow.madison.wi.us - python / cdb - interface to djb's pa...     http://pilcrow.madison.wi.us/     tags: cdb dbm sleepycat bsddb python