16
or LOL

Tokyo Cabinet

Embed Size (px)

DESCRIPTION

tokyo cabinet database overview

Citation preview

Page 1: Tokyo Cabinet

or

LOL

Page 2: Tokyo Cabinet

Tokyo

Page 3: Tokyo Cabinet

Cabinet

Page 4: Tokyo Cabinet
Page 5: Tokyo Cabinet

Runs in...Runs on Linux, Solaris, Mac OS X

Page 6: Tokyo Cabinet

tokyo cabinet storage

<key, value>database manager DBM Persisted in file system

Tokyo Cabinet

<k, v> <k, v>

Page 7: Tokyo Cabinet

Why Tokyo?

space efficiency : small database file size.time efficiency : fast processing speed.parallelism : high performance in multi-thread environment.usability : simple API’s.64-bit architecture : enormous memory space and database file are available.No-SQL

Page 8: Tokyo Cabinet

Database Structures:- Hash- B+ Tree- Fixed-Length- Table

Page 9: Tokyo Cabinet

Hash Database

Page 10: Tokyo Cabinet

B+ Tree Database

• slower than hash database • Logical sorted (Last Recent Used)• Stands in a Hash Database

Page 11: Tokyo Cabinet

Fixed-length Database• natural number keys• extremely fast

Page 12: Tokyo Cabinet

Table Database

• expresses a structure like a table of relational database.

• column based• flexible structure• query mechanism• column indexes

Page 13: Tokyo Cabinet
Page 14: Tokyo Cabinet

Tokyo Cabinet is 31 times faster than MySQL!

• Total time used to write 10000 records and retrieve them back Tokyo Cabinet: 18.87sMySQL: 562.21s

Page 15: Tokyo Cabinet

Advantages Disadvantages

NO-SQL Windows platform is not supported

Speed not durable (isn’t crash safe)

high scalability: No actual limit size of a database file (to 8 exabytes)

LOCK (only one transaction can be activated with the database at the same time)

Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, Java, and Lua.

high concurrency

Write-ahead logging:(log transaction status-> succeeded, half-succeeded, or failed)

Page 16: Tokyo Cabinet

Thank You!