4 dépôts
Key-value store implementations that maintain entries sorted by key for range queries and efficient access.
Distinct from Insertion Order Preserving Maps: Existing candidates focus on insertion-order preservation or value-based sorting; this specifically covers key-sorted maps.
Explore 4 awesome GitHub repositories matching data & databases · Sorted Key-Value Maps. Refine with filters or upvote what's useful.
Il s'agit d'une implémentation de structure de données B-Tree en mémoire pour Go. Elle fournit une collection résidente en mémoire qui maintient des éléments triés pour permettre une récupération, une modification et une gestion efficaces des cartes clé-valeur triées. Le projet prend en charge les collections mutables ordonnées et les magasins clé-valeur triés, permettant des recherches, insertions et suppressions rapides tout en préservant l'ordre de tri des clés. Il fournit des capacités de recherche par plage au sein de structures en mémoire triées et maintient l'organisation des jeux de données grâce au fractionnement de nœuds auto-équilibré et à la recherche binaire récursive.
A data structure for storing ordered pairs that enables range queries and fast key-based access.
Levelup is a sorted key-value storage system that saves and retrieves data using byte arrays as keys and values. It provides a compatibility layer for Node.js and browsers that offers a unified interface for storage backends compliant with a specific abstract standard. The project features an atomic batch write engine to execute multiple write and delete operations as a single unit for data consistency. It includes a range-based data streamer for reading keys and values as continuous sequences and an event-driven storage monitor to track asynchronous updates and state changes. The system cov
Provides a key-value store that maintains entries sorted by key to enable efficient range queries.
Level is a database library that provides a unified interface for managing sorted key-value data. It functions as an abstraction layer that allows applications to store and retrieve binary information consistently across server-side environments and web browsers. The project utilizes a modular architecture that supports pluggable storage backends, enabling the system to adapt to different host environments while maintaining identical behavior. By organizing data in lexicographical order, it facilitates efficient range queries and ordered retrieval. The library handles large datasets through a
Organizes data in lexicographical order to facilitate efficient range queries and ordered retrieval.
This project is a comprehensive library of type-safe, high-performance data structures for Go. By leveraging language-level generics, it provides reusable containers and algorithms that eliminate the need for runtime type assertions or interface casting, ensuring efficient and type-safe data management. The library distinguishes itself through its support for persistent data structures and specialized indexing. It utilizes copy-on-write semantics and memory sharing to maintain multiple versions of a collection, allowing for efficient modifications without duplicating entire datasets. Addition
Organizes data into key-value pairs where each key maps to multiple values.