2 repositorios
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.
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.
Esta es una implementación de estructura de datos B-Tree en memoria para Go. Proporciona una colección residente en memoria que mantiene elementos ordenados para permitir una recuperación eficiente, modificación y gestión de mapas de clave-valor ordenados. El proyecto admite colecciones mutables ordenadas y almacenes de clave-valor ordenados, permitiendo búsquedas, inserciones y eliminaciones rápidas mientras se preserva el orden de clasificación de las claves. Proporciona capacidades para la búsqueda por rango dentro de estructuras de memoria ordenadas y mantiene la organización de los conjuntos de datos mediante la división de nodos auto-balanceados y la búsqueda binaria recursiva.
Provides a BTreeMap-like interface for key-value pairs that preserves key order.