kyotocabinet 1.2.79-1 source package in Ubuntu
Changelog
kyotocabinet (1.2.79-1) unstable; urgency=medium
* New upstream release.
* debian/copyright: Refresh information.
* Refresh patches:
- test-disable-dir-db-test-fails-on-tmpfs-btrfs.patch:
Dropped, upstream has fixed the failing test.
- cpp-14.patch: Dropped, merged upstream.
- doc-kyotoproducts.pdf.patch: Update with new URL.
-- Boyuan Yang <email address hidden> Sun, 15 Aug 2021 09:45:55 -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 | |
|---|---|---|---|---|
| Jammy | release | universe | utils |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| kyotocabinet_1.2.79-1.dsc | 2.1 KiB | 561f87a113c394d0a7e3ce615f38e46ca198a9d9381a4d430521ecffcdae749f |
| kyotocabinet_1.2.79.orig.tar.gz | 921.7 KiB | 67fb1da4ae2a86f15bb9305f26caa1a7c0c27d525464c71fd732660a95ae3e1d |
| kyotocabinet_1.2.79-1.debian.tar.xz | 8.5 KiB | fc6e7e17d2981fea7d0cf8e3819255e4eb35b4c3b51cb9b82d14c9be5ff3e4eb |
Available diffs
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: No summary available for kyotocabinet-utils-dbgsym in ubuntu kinetic.
No description available for kyotocabinet-
utils-dbgsym in ubuntu kinetic.
- 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
