4 repository-uri
Key-value stores that maintain a specific sequence of entries to enable range queries.
Distinct from Key-Value Stores: Specifically requires the sorted property, unlike general key-value stores.
Explore 4 awesome GitHub repositories matching data & databases · Sorted. Refine with filters or upvote what's useful.
LevelDB is an embedded database library and persistent storage engine that provides a sorted key-value store. It uses a log-structured merge-tree architecture to map byte arrays to values, running directly within a process to provide storage without the need for a separate server process. The system is distinguished by its use of custom comparison functions to define key ordering, enabling efficient range scans and sequenced lookups. It ensures data reliability through atomic batch execution, consistent snapshot generation, and log-based recovery after failures. The engine covers broad capab
Maintains entries in a specific sequence using custom comparison functions for efficient range scans.
Levelup este un sistem de stocare cheie-valoare sortat care salvează și preia date folosind octeți (byte arrays) ca chei și valori. Oferă un strat de compatibilitate pentru Node.js și browsere, care oferă o interfață unificată pentru backend-uri de stocare conforme cu un standard abstract specific. Proiectul dispune de un motor de scriere în loturi atomice pentru a executa mai multe operații de scriere și ștergere ca o singură unitate, asigurând consistența datelor. Include un streamer de date bazat pe intervale pentru citirea cheilor și valorilor ca secvențe continue și un monitor de stocare bazat pe evenimente pentru a urmări actualizările asincrone și schimbările de stare. Sistemul acoperă primitive de bază de date mai largi, inclusiv ștergerea datelor bazată pe intervale și abstractizarea motorului de backend pentru a menține un set de comenzi consistent în diferite medii de runtime.
Enables the reading of keys and values as continuous sequences via range bounds and result limits.
This is a Python library providing sorted list, set, and dictionary data structures that maintain their order automatically during insertions and deletions. The library provides a sorted list for fast random access and logarithmic lookups, a sorted set for unique elements and set-theoretic operations, and a sorted dictionary for managing key-value pairs where keys remain sorted. These collections support custom sorting logic through user-defined key functions to determine the order of elements. Core capabilities include positional indexing, range queries, and the use of bisection methods to
Implements a sorted dictionary that maintains key order to facilitate fast range queries and positional lookups.
This project is a disk-backed key-value store and persistent data structure library for Python. It provides a mechanism for persisting mappings, sets, and queues to the local filesystem to bypass memory limitations and cache expensive function results across threads and processes. The system serves as a cross-process synchronization tool, offering distributed locks, semaphores, and barriers to coordinate shared resource access. It implements advanced caching strategies such as probabilistic stampede prevention, sharded data partitioning to increase throughput, and least-recently-used eviction
Provides key-value storage that maintains sorted keys for efficient range-based lookups and ordered iteration.