Kyoto 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. each key must be unique within a database. there is neither concept of data tables nor data types. records are organized in hash table or b+ tree.

kyoto cabinet runs very fast. for example, elapsed time to store one million records is 0.9 seconds for hash database, and 1.1 seconds for b+ tree database. moreover, the size of database is very small. for example, overhead for a record is 16 bytes for hash database, and 4 bytes for b+ tree database. furthermore, scalability of kyoto cabinet is great. the database size can be up to 8eb (9.22e18 bytes).

sponsored by the same company, kyoto cabinet is "[a] more powerful and convenient library than tokyo cabinet [and] surpasses tokyo cabinet in every aspect".

this package contains the documentation.