10 Repos
Mechanisms for defining custom comparison logic to control how keys are sorted and stored.
Distinguishing note: None of the candidates cover sorting logic; most focus on routing, listing, or deletion.
Explore 10 awesome GitHub repositories matching data & databases · Custom Key Ordering. 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
Specify a custom comparison function to determine how keys are sorted and stored in the project.
FoundationDB is an ACID-compliant distributed transactional key-value store. It functions as a scalable database engine that ensures strict serializability and data consistency across a cluster of servers using a shared-nothing architecture. The system is distinguished by its multi-region replication capabilities, allowing data to be synchronized across different datacenters for high availability and disaster recovery. It utilizes optimistic concurrency control to manage distributed transactions and employs a majority-based coordination system to maintain cluster state. The platform provides
Stores data as sorted byte strings to enable efficient range scans and prefix-based retrieval.
bbolt is an ACID-compliant embedded key-value store for Go applications. It persists all data in a single memory-mapped file on disk, organizing information using B+ trees to facilitate sorted key iteration and efficient range queries. The project distinguishes itself through a hierarchical data organization model, allowing buckets to be nested within other buckets to create a tree-like structure. It employs a single-writer, multi-reader locking mechanism and copy-on-write transactions to ensure serializable isolation and data integrity. The system includes comprehensive data management capa
Stores keys in byte-sorted order to enable efficient range scans and sequential iteration via cursors.
LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Implements a solution to locate the kth smallest integer in a lexicographically sorted range.
goleveldb ist eine eingebettete Key-Value-Speicherdatenbank für Go. Sie bietet lokale Datenpersistenz und Indizierung, wodurch Anwendungen Informationen mithilfe eindeutiger Schlüssel speichern und abrufen können, ohne einen separaten Server zu benötigen. Die Datenbank organisiert Daten mithilfe eines Log-Structured-Merge-Trees und persistenter Indizierung in lexikografischer Reihenfolge. Diese Struktur unterstützt effiziente Bereichsscans und präfixbasierte Suchen. Das System enthält Funktionen für atomare Batch-Schreibvorgänge, um Datenkonsistenz zu gewährleisten und Teil-Updates zu vermeiden. Die Performance wird durch Write-Ahead-Logging, speicherbasiertes Buffering und Bloom-Filter verwaltet, um unnötige Festplatten-I/O zu reduzieren.
Stores keys in a strict byte-order sequence to enable efficient range scans and prefix-based searches.
Libation is a comprehensive audiobook management system designed to download, decrypt, and organize Audible audiobooks. It integrates account authentication, library synchronization, DRM removal, and format transcoding into a single desktop application with a plugin-free graphical interface and a built-in theme editor. The project distinguishes itself through a batch library synchronization engine that scans all configured Audible accounts in one pass, a metadata tag rewriting system that corrects chapter markers and cover art after decryption, and a template-based file naming engine that con
Filters audiobooks whose field values fall within a specified inclusive or exclusive range, sorted lexicographically.
Dieses Projekt ist eine Implementierung des ULID-Standards in der Programmiersprache Go. Es bietet Tools zur Generierung universell eindeutiger, lexikographisch sortierbarer Identifikatoren, die Millisekunden-Zeitstempel mit Zufallsdaten kombinieren. Die Bibliothek stellt sicher, dass Identifikatoren durch alphabetische Sortierung die chronologische Reihenfolge beibehalten. Sie enthält einen monotonen Generator, um zu garantieren, dass mehrere Identifikatoren, die innerhalb derselben Millisekunde erstellt wurden, in einer streng aufsteigenden Sequenz produziert werden. Das Projekt deckt die Generierung eindeutiger Identifikatoren und die Optimierung von Datenbank-Primärschlüsseln ab. Es bietet zudem ein Command-Line-Interface zur Generierung neuer Identifikatoren und zum Extrahieren von Zeitstempelinformationen aus bestehenden Identitäts-Strings.
Ensures identifiers are byte-sorted lexicographically, allowing them to be sorted alphabetically by creation time.
This PHP data collection library is a functional data wrapper and array manipulation framework. It converts arrays, JSON strings, and iterables into chainable collection objects designed for advanced filtering, sorting, and transformation. The library is distinguished by its ability to dynamically extend functionality through the registration of custom methods via closures. It also provides specialized capabilities for hierarchical data modeling, allowing flat datasets with parent-child identifiers to be reconstructed into nested tree structures. The toolkit covers a broad surface of data ma
Orders items by values, keys, or custom callbacks with ascending/descending and key preservation.
Levelup ist ein sortiertes Key-Value-Speichersystem, das Daten unter Verwendung von Byte-Arrays als Keys und Values speichert und abruft. Es bietet eine Kompatibilitätsschicht für Node.js und Browser, die ein einheitliches Interface für Speicher-Backends gemäß einem spezifischen abstrakten Standard bereitstellt. Das Projekt verfügt über eine atomare Batch-Write-Engine, um mehrere Schreib- und Löschoperationen als eine einzige Einheit für Datenkonsistenz auszuführen. Es enthält einen bereichsbasierten Daten-Streamer zum Lesen von Keys und Values als kontinuierliche Sequenzen sowie einen ereignisgesteuerten Speicher-Monitor zur Verfolgung asynchroner Updates und Zustandsänderungen. Das System deckt breitere Datenbank-Primitive ab, einschließlich bereichsbasiertem Löschen von Daten und Backend-Engine-Abstraktion, um einen konsistenten Befehlssatz über verschiedene Laufzeitumgebungen hinweg beizubehalten.
Allows the retrieval of all keys and values within a specific byte-sorted range using streaming and 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
Allows determining the sort order of collections through a provided key extraction function.