tokyo.cabinet — Python Tokyo Cabinet interface.

Platforms: POSIX

Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array. Tokyo Cabinet is developed as the successor of GDBM and QDBM on the following purposes. They are achieved and Tokyo Cabinet replaces conventional DBM products.

  • improves space efficiency: smaller size of database file.
  • improves time efficiency: faster processing speed.
  • improves parallelism: higher performance in multi-thread environment.
  • improves usability: simplified API.
  • improves robustness: database file is not corrupted even under catastrophic situation.
  • supports 64-bit architecture: enormous memory space and database file are available.


Rewrite the previous section (copy/pasted from

See also

Fundamental Specifications of Tokyo Cabinet Version 1 for more information about Tokyo Cabinet.

exception tokyo.cabinet.Error
Raised when an error specific to Tokyo Cabinet happens.
Returns the version string of the underlying Tokyo Cabinet library.

The largest positive and negative integers as defined by the platform (mainly used for testing addint()).

New in version 0.5.0.

Previous topic

Welcome to tokyo-python’s documentation!

Next topic

Hash Database — HDB

This Page