Search Results for "btree"

...It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. The implementation favors minimal allocations and locality, making it attractive for indexing, query engines, and caches that need predictable iteration costs. A simple Item interface with a Less method defines ordering, keeping the API small and flexible for custom types. ...

...It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions. A list is a data structure that stores values and may have repeated values. A list backed by a dynamic array that grows and shrinks implicitly. A list where each element points to the next element in the list. ...

PFS is a try to design a filesytem by myself, it's designed depend on inode , and ensure the consistency of the filesystem. The first version, pfs is a application program for linux, now it's a driver for linux. pfs isn't depend on bit map or btree, it also don't support log. At the first version, i try to deal with the dependency of filesystem to make sure the consistency for filesystem.now, i want to improve the measure, so the driver for linux don't ensure the consistency fo filesystem(i will support at next version). pfs don't support extended attributes now, i obligate 8k for every inode to support extended attributes in the feature.

A small, sane btree library, derived from the old berkeley db 1.85 code base. - as fast and simple as a sequential text file for sequential writes - easy to use, difficult to abuse - large data values and large key values that actually work - a cache management that tries to avoid any btree corruption: - if a page is evicted, all dirty pages are flushed to the underlying fd - signals are blocked in the critical section

Big Sack is a Java persistence mechanism that allows storage of key value pairs following the popular Big Data paradigms. Its a very simple and straightforward way to bridge the gap between in-memory data structures and long-term storage. It has the convenience of Java SDK TreeMap and TreeSet classes and is used the same easy way, but it includes rollback through undo logging to checkpoint data so it does not wind up in an unknown state regardless of failures. Data storage in the exabyte...

xBase database library. Creates traditional dBase III Plus and FoxPro database files. Unique dual btree indexes allow multiple indexes in each disk file. Small disk/memory footprint (81K). Ability to interface to multiple programming languages. Cheetah is an extremely fast, old school, traditional record manager. Cheetah can be used with any compiler that can link to a standard Windows DLL.

...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: For details on performance chart, please refer the performane section of wiki.

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.

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

Object pascal library (TurboPascal, Delphi, Free Pascal Compiler). Btree indexes, DBF database files, tools for user interface and more.

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.