Group :: Banco de dados
RPM: kyotocabinet
Navegação
Principal Changelog Spec Patches Sources Download Gear Bugs e FR Repocop
A versão atual: 1.2.76-alt3
Data da compilação: 17 julho 2017, 09:27 ( 352.7 weeks ago )
Tamanho:: 386.44 Kb
Home page: http://fallabs.com/kyotocabinet/
Licença: GPLv3
Sumário: library of routines for managing a database
Descrição:
Lista dos contribuidores Lista dos rpms provida por esta srpm:
ACL:
Data da compilação: 17 julho 2017, 09:27 ( 352.7 weeks ago )
Tamanho:: 386.44 Kb
Home page: http://fallabs.com/kyotocabinet/
Licença: GPLv3
Sumário: library of routines for managing a database
Descrição:
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).
Mantenedor currente: Aleksei Nikiforov 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).
Lista dos contribuidores Lista dos rpms provida por esta srpm:
- kyotocabinet-doc
- kyotocabinet-utils
- kyotocabinet-utils-debuginfo
- libkyotocabinet
- libkyotocabinet-debuginfo
- libkyotocabinet-devel