2 个仓库
Awesome GitHub RepositoriesOrdered Map Data Access
Accesses stored key-value pairs through a BTreeMap-like interface that preserves key order and supports range queries.
Distinct from Ordered Data Structures: Distinct from Ordered Data Structures: focuses on the access interface for ordered data, not just the preservation of insertion order.
Explore 2 awesome GitHub repositories matching data & databases · Ordered Map Data Access. Refine with filters or upvote what's useful.
Awesome Ordered Map Data Access GitHub Repositories
用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
- cberner/redb
cberner/redb
4,248在 GitHub 上查看redb is an embedded key-value store and ACID-compliant storage engine. It functions as a persistent storage system for saving and retrieving data as key-value pairs within a tree structure. The engine is built as an MVCC transactional database, utilizing multi-version concurrency control to manage simultaneous reads and writes without blocking. It employs a single-writer multi-reader model to ensure data consistency while allowing multiple threads to access the store. The system provides persistent state management and atomic transaction management to prevent data corruption during crashes.
Provides ordered map data access through a BTreeMap interface with range query support.
Rustrust - google/btree
google/btree
4,166在 GitHub 上查看这是一个用于 Go 的内存中 B-Tree 数据结构实现。它提供了一个驻留内存的集合，维护排序元素以实现高效的检索、修改以及排序键值映射的管理。 该项目支持有序可变集合和排序键值存储，允许在保持键排序顺序的同时进行快速查找、插入和删除。 它提供了在排序内存结构中进行范围搜索的功能，并通过自平衡节点分裂和递归二分搜索来维护数据集的组织。
Provides a BTreeMap-like interface for key-value pairs that preserves key order.
Go
