summaryrefslogtreecommitdiffstats
path: root/database/kyotocabinet/DETAILS
diff options
context:
space:
mode:
Diffstat (limited to 'database/kyotocabinet/DETAILS')
-rwxr-xr-xdatabase/kyotocabinet/DETAILS23
1 files changed, 23 insertions, 0 deletions
diff --git a/database/kyotocabinet/DETAILS b/database/kyotocabinet/DETAILS
new file mode 100755
index 0000000000..f186f1961d
--- /dev/null
+++ b/database/kyotocabinet/DETAILS
@@ -0,0 +1,23 @@
+ SPELL=kyotocabinet
+ VERSION=1.2.51
+ SOURCE_HASH=sha512:acd981440186bed0e53e7a20fd6499e7953abfe612a1df6e190f806fcb547bc3cc19d24cb87c5152de74aa633350cc548452851869a949d96e68cd12befb9a05
+ SOURCE=$SPELL-$VERSION.tar.gz
+SOURCE_DIRECTORY=$BUILD_DIRECTORY/$SPELL-$VERSION
+ WEB_SITE=http://fallabs.com/kyotocabinet
+ SOURCE_URL[0]=$WEB_SITE/pkg/$SOURCE
+ LICENSE[0]=GPL
+ ENTERED=20110413
+ KEYWORDS="database"
+ SHORT="database library"
+cat << EOF
+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).
+EOF