17 个仓库
Data structures that store unique elements associated with numerical scores to enable efficient range queries and ranking operations.
Distinguishing note: None of the candidates were provided; this is a specific data structure category under the Data & Databases umbrella.
Explore 17 awesome GitHub repositories matching data & databases · Sorted Sets. Refine with filters or upvote what's useful.
Dragonfly is a high-performance, multi-model in-memory data store designed to serve as a drop-in replacement for existing database infrastructures. By utilizing a multi-threaded, shared-nothing architecture and a fiber-based concurrency model, it maximizes CPU utilization and minimizes latency for read and write operations. The system supports a wide range of data structures, including strings, hashes, lists, sets, sorted sets, and JSON documents, while maintaining full compatibility with standard industry wire protocols and client libraries. What distinguishes Dragonfly is its focus on effic
Maintains collections of unique elements associated with numerical scores to perform efficient range queries and rank-based data retrieval operations.
This project is a feature-rich Go client library designed for interacting with Redis. It serves as a comprehensive interface for managing remote data stores, enabling developers to execute standard database commands, handle complex data structures, and perform asynchronous operations within Go applications. The library distinguishes itself through its support for advanced Redis capabilities, including connection pooling, pipelining, and transactional integrity. It provides specialized primitives for managing distributed clusters, including automated topology updates and request routing to sha
Stores and retrieves items in sorted collections based on assigned scores to facilitate ranking and leaderboard functionality.
ioredis is a performance-focused Redis client for Node.js applications. It provides a comprehensive interface for interacting with Redis servers, including specialized clients for sharded clusters and Sentinel-based high availability environments. The project distinguishes itself through advanced networking and execution capabilities, such as automatic event-loop pipelining to reduce overhead and a system for routing read-write traffic between primary and replica nodes. It also features a dedicated Lua scripting interface that allows server-side scripts to be registered as custom client comma
Manages unique strings ordered by numerical scores to enable efficient ranking and range queries.
Sidekiq is a background job processor and queue manager for Ruby that uses Redis to manage asynchronous tasks. It functions as a distributed task scheduler capable of handling periodic, delayed, and recurring jobs across a cluster of worker processes. The project features a job monitoring dashboard and administrative web interface for visualizing system state, tracking worker performance, and managing failed or dead jobs. It provides a distributed rate limiter to control execution frequency across multiple processes. The framework covers a broad range of operational capabilities, including j
Uses Redis sorted sets to store and trigger future jobs once the current time exceeds the job timestamp.
Garnet is a multi-threaded in-memory database and distributed key-value store. It functions as a high-performance remote cache store that implements the RESP wire protocol to maintain compatibility with existing Redis clients and libraries. The project is distinguished by a shared-memory architecture that enables parallel request processing across multiple cores for sub-millisecond latency. It features a tiered storage system that automatically offloads colder data from system memory to SSD or cloud storage layers, and includes a specialized vector search database for high-dimensional similar
Stores unique elements associated with numerical scores to maintain ordered lists for ranking.
phpredis is a C-based native extension that bridges PHP applications with Redis servers for high-performance data storage and retrieval. It serves as an interface for manipulating strings, hashes, lists, sets, and sorted sets while providing a direct path for executing Redis commands and server-side scripts. The extension provides comprehensive support for distributed environments and high availability. It interfaces with Redis Cluster to distribute data across multiple nodes using hash slots and manages Redis Sentinel for service discovery and automatic failover. It also enables shared state
Provides native support for sorted set data structures, enabling efficient range queries and ranking operations.
Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL database. It provides sub-millisecond read and write access to data stored in RAM and can operate as a vector database for indexing high-dimensional embeddings. The system supports a wide range of data storage and synchronization primitives, including the management of strings, hashes, lists, sets, and JSON documents. It enables real-time data operations through atomic transactions, hybrid persistence using snapshots and append-only logs, and high-availability configurations
Enables counting the number of elements in a sorted set that fall within a specific score range.
RedisInsight is a graphical user interface and management tool for browsing, analyzing, and administering Redis databases. It provides a visual environment for exploring key-value data structures, managing database instances, and performing data analysis across different operating systems and deployments. The tool distinguishes itself by providing dedicated visual managers for complex operations, including a vector database manager for configuring embeddings and similarity searches, a query workbench for executing raw commands and Lua scripts, and a performance monitoring dashboard for tracki
Provides capabilities to count or identify elements within specific numerical score windows in sorted sets.
algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I
Implements a sorted integer set using a sorted array for fast membership queries and rank lookups.
Redka 是一个基于 SQL 的键值存储,实现了 Redis 兼容接口。它充当关系数据桥梁,将非关系协议命令转换为关系查询,从而使用 SQL 数据库后端提供持久性和 ACID 事务。 该系统允许通过将内部键值数据公开为 SQL 视图来进行关系数据内省,从而支持通过关系语法进行直接查询和分析。它可以作为独立的网络服务器部署,也可以作为 Go 应用程序中的嵌入式库部署。 该项目支持多种数据结构,包括字符串、列表、哈希、无序集合和有序集合。它提供了具有生存时间(TTL)元数据的键生命周期管理、原子数值操作和集合代数功能。为了管理性能和访问,它包括内存存储模式和只读连接模式。
Stores unique strings associated with numeric scores to enable retrieval by rank or score range.
Kvrocks 是一个基于磁盘的 NoSQL 数据库和分布式键值存储,利用 RocksDB 存储引擎将大数据集持久化到物理磁盘。它被设计为 Redis 兼容数据库,利用标准的 Redis 通信协议确保与现有客户端库和工具的互操作性。 该项目的独特之处在于将磁盘持久化存储模型与高级检索能力相结合,包括用于 k-近邻查询的向量搜索、全文搜索索引和地理空间查询执行。它支持具有基于槽位(slot)的数据分布和拓扑管理的分布式集群,以实现水平扩展和高可用性。 该系统涵盖了广泛的数据存储类型,包括 JSON 文档、流、有序集合、哈希映射和位图。它提供了全面的数据管理工具,如原子事务、基于日志的复制以及用于基数估计和成员检查的概率数据结构。此外,它还包括服务端脚本、发布/订阅消息传递以及针对服务器健康状况和存储引擎性能的详细监控。
Maintains a set of unique integer members sorted in ascending order.
Kvrocks 是一个分布式键值存储和 Redis 兼容的 NoSQL 数据库。它利用 RocksDB 存储引擎提供基于磁盘的持久化,与内存系统相比,允许以更低的内存成本进行大容量数据存储。 该系统作为向量数据库和全文搜索引擎,支持对向量嵌入进行近邻搜索,并通过文本匹配进行复杂的文档查询。它采用无代理(proxyless)集群架构,通过基于槽位的路由来分发数据并在多个节点间扩展容量。 该平台涵盖了广泛的数据管理能力,包括 JSON 文档管理、时序数据和实时流处理。它通过地理空间查询、二级索引和查询计划分析提供高级搜索和索引功能,同时提供用于内存高效的基数和成员估计的概率数据草图。 其他操作特性包括原子事务、发布/订阅消息传递以及用于多租户环境的命名空间数据隔离。
Stores unique members with numerical scores to enable range queries by index or lexicographical order.
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 set for unique elements, supporting set-theoretic operations and index-based access.
该项目是一个针对 R 的高性能表格数据处理框架,旨在以内存效率和速度处理海量数据集。它提供了一种增强的数据结构,利用引用语义和就地修改来执行复杂的转换,而无需不必要的对象复制开销。 该库凭借其底层架构优化脱颖而出,包括多线程并行处理、基数排序和内存映射文件解析。通过将关键的数据操作和聚合例程卸载到编译后的 C 代码,它实现了对原本计算昂贵的任务的快速执行。其核心引擎支持高级关系操作,如非等值连接、滚动连接和重叠区间连接,以及用于加速重复数据访问的自动二级索引。 除了主要的处理功能外,该项目还提供了一套全面的数据生命周期管理工具。这包括具有自动类型检测的高速摄取和序列化工具,以及对时间序列分析和多维聚合的专门支持。该框架旨在实现可扩展性,允许用户在包含数十亿行的数据集上执行复杂的分组、过滤和重塑操作,同时保持系统稳定性和性能。
Provides specialized date and time classes that use integer storage for memory efficiency and faster arithmetic operations.
Godis is a Redis-compatible in-memory database and distributed key-value store. It functions as a replicated data store and distributed message broker, implementing the Redis protocol to manage complex data structures in memory. The system provides a geospatial indexing engine for proximity-based queries and distance calculations. It ensures high availability and data durability through master-slave replication and write-ahead logging. The project covers a wide range of capabilities including the management of strings, hash maps, lists, and sorted sets. It supports distributed data clusterin
Supports sorted sets that store unique elements ordered by score for ranking and range retrieval.
NutsDB is an ACID-compliant, embedded transactional storage engine that functions as both a disk-backed key-value store and an in-memory data structure store. It provides atomic and serializable transactions with commit and rollback capabilities to ensure strict data consistency for applications requiring a lightweight persistence layer. The engine distinguishes itself by supporting a variety of complex data types, including lists, sets, and sorted sets, alongside standard byte-slice storage. It implements a transactional storage model featuring hot backups and a compaction algorithm to maint
Stores unique elements associated with numerical scores to enable efficient range queries and ranking operations.
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 collections of unique elements that remain sorted on disk for range queries and ranking.