Tokyo Cabinet is a library of routines for managing a database. It is the successor of QDBM. Tokyo Cabinet runs very fast. For example, the time required to store 1 million records is 1.5 seconds for a hash database and 2.2 seconds for a B+ tree database. Moreover, the database size is very small. For example, the overhead for a record is 16 bytes for a hash database, and 5 bytes for a B+ tree database. Furthermore, the scalability of Tokyo Cabinet is great. The database size can be up to 8EB.
|Tags||Software Development Libraries Database Database Engines/Servers|
Release Notes: New functions were added, several potential memory leaks were resolved, and the site's documents were updated.
Release Notes: Two kinds of inverted indices were added to the table database API. Token inverted index realizes tag search. Q-gram inverted index realizes full-text search.
Release Notes: Auto defragmentation was added. Efficiency of the index mechanism of the table database was improved.
Release Notes: Perl/Ruby interfaces of the table database API were added.
Release Notes: Bugs related to a race condition in the hash database API were fixed. Utility functions were added for the table database API.