kyotocabinet 1.2.80-1 source package in Ubuntu
Changelog
kyotocabinet (1.2.80-1) unstable; urgency=medium * Upload to unstable. -- Boyuan Yang <email address hidden> Mon, 12 Jun 2023 16:36:47 -0400
Upload details
- Uploaded by:
- Boyuan Yang
- Uploaded to:
- Sid
- Original maintainer:
- Boyuan Yang
- Architectures:
- any all
- Section:
- utils
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | utils |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
kyotocabinet_1.2.80-1.dsc | 2.1 KiB | 1f3ebbdbf8bcb7918336614d2801b1b682d8f885f849f004a2a426c38a37b159 |
kyotocabinet_1.2.80.orig.tar.gz | 920.5 KiB | 4c85d736668d82920bfdbdb92ac3d66b7db1108f09581a769dd9160a02def349 |
kyotocabinet_1.2.80-1.debian.tar.xz | 8.7 KiB | 70ecfef2af4783592b25c0d702213eb8c0ea43f869ad0ce0a9426b4156ab8823 |
Available diffs
- diff from 1.2.79-2 to 1.2.80-1 (3.5 KiB)
No changes file available.
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