Tokyo Cabinet
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 |
|---|---|
| Licenses | LGPL |
| Operating Systems | POSIX |
| Implementation | C |
Recent releases
- 21 Jun 2009 19:57
Changes: 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.
- 21 May 2009 07:40
Changes: Auto defragmentation was added. Efficiency of the index mechanism of the table database was improved.
- 15 Feb 2009 08:30
Changes: Perl/Ruby interfaces of the table database API were added.
- 12 Feb 2009 07:43
Changes: Bugs related to a race condition in the hash database API were fixed. Utility functions were added for the table database API.
- 18 Jan 2009 14:55
Changes: The table database API was added. It manages a database of records of named columns. Functions with sub-indexes are also provided and they improve performance of complex queries.
- All comments
Recent commentsFantastic! Your work allows the little guy/gal with a PC to compete against those with high-end computing platforms.
It is just a great job from the author of TokyoCabinet, it is really an amazing work. Thank you for sharing this library