Skip to content
forked from disembl/tree

An embedded, simple, fast, concurrent, on-disk key-value store using a b+tree.

Notifications You must be signed in to change notification settings

chinazhaoht/tree

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

An embedded, tiny, fast, on-disk, concurrent key-value store using b+trees.

A database is stored in a single file.

On most POSIX systems, multiple processes can safely access a single file.

Supports put(key,value), get(key), and delete(key).

Usage examples can be found in main()

About

An embedded, simple, fast, concurrent, on-disk key-value store using a b+tree.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published