Search Results for "btree c"

One of the fastest, 100% Pure Java In-memory cache. Its aimed at providing very fast, light, highly scalable cache with high concurrency. The fetch operation from cache are always in constant time, O(c), irrespective of the number of threads accessing the cache or cache size. NitroCache uses unique custom algorithm inspired by Btree, skiplist and hashing to deliver a constant time cache with lock-less fetches. For details on using NitroCache, please visit wiki section Note...

用c实现了常用的容器，如果rbtree,hashtable,list,vector,deque,heap,map,以及定时器，os api，应用开发框架。 实现了一个基于btree索引算法的文件数据库,提供了断电保护,以及事务提交与回滚等接口

Cross platform indexed file btree implementation in C#, java and Python: Commit/abort transactions, localized unicode string order, recovery of damaged files, and configurable memory footprint, hashing, prefixing, and object serialization.

This is a full implementation of a B+Tree disk based system written in C, suitable for use in most any applications that requires a BTree type index. It is intended for use on all versions of Unix operating systems and portable to Windows OS

This project implements a btree in c++, and it would provide a static/dynamic library for use.