Ubuntu
kyotocabinet package

kyotocabinet 1.2.80-1build1 source package in Ubuntu

Changelog

kyotocabinet (1.2.80-1build1) noble; urgency=high

  * No change rebuild against frame pointers and time_t.

 -- Julian Andres Klode <email address hidden>  Mon, 22 Apr 2024 16:53:02 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
utils
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Noble release universe utils

Downloads

File Size SHA-256 Checksum
kyotocabinet_1.2.80.orig.tar.gz 920.5 KiB 4c85d736668d82920bfdbdb92ac3d66b7db1108f09581a769dd9160a02def349
kyotocabinet_1.2.80-1build1.debian.tar.xz 8.8 KiB 196d27ce300bfdde649c1fee538fe98a7661b6fc3285453806d391375002aa50
kyotocabinet_1.2.80-1build1.dsc 2.2 KiB 48d004b5af9ada73728610ffec0ac203e26a86746ebc503db9b430db071c4d45

View changes file

Binary packages built by this source

kyotocabinet-doc: Straightforward implementation of DBM - docs

 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.

kyotocabinet-utils: Straightforward implementation of DBM - utilities

 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.
 .
 This package contains the kcutilmgr tool, used to compile kyotocabinet
 language bindings without Debian patches applied, and well as testing
 and debugging utilities.

kyotocabinet-utils-dbgsym: debug symbols for kyotocabinet-utils
libkyotocabinet-dev: Straightforward implementation of DBM - development headers

 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.
 .
 This package contains the development headers.

libkyotocabinet16v5: Straightforward implementation of DBM - shared library

 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.
 .
 This package contains the shared library.

libkyotocabinet16v5-dbgsym: debug symbols for libkyotocabinet16v5