awesome-repositories.com
博客
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目关于排名机制媒体报道MCP 服务器
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

4 个仓库

Awesome GitHub RepositoriesData Shuffling Algorithms

Methods for redistributing data across nodes to support complex operations like joins.

Distinguishing note: Focuses on shuffling logic rather than general data movement.

Explore 4 awesome GitHub repositories matching data & databases · Data Shuffling Algorithms. Refine with filters or upvote what's useful.

Awesome Data Shuffling Algorithms GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • ray-project/rayray-project 的头像

    ray-project/ray

    42,895在 GitHub 上查看↗

    Ray is a distributed computing framework designed to scale Python and Java applications across clusters by abstracting task scheduling and resource management. It functions as a resource-aware execution engine that manages task dependencies, placement, and fault tolerance across networked compute nodes. At its core, the system provides a stateful actor model, allowing developers to define classes that run in dedicated processes to maintain and mutate internal state across remote method calls. The framework distinguishes itself through a robust cross-language interoperability layer, enabling f

    Redistributes data across the cluster using hash or range algorithms to support joins and group-by operations.

    Pythondata-sciencedeep-learningdeployment
    在 GitHub 上查看↗42,895
  • vonng/ddiaVonng 的头像

    Vonng/ddia

    22,648在 GitHub 上查看↗

    This project serves as a comprehensive technical reference for the architecture and design of data-intensive applications. It provides a structured analysis of the fundamental principles required to build reliable, scalable, and maintainable software systems, covering the core trade-offs inherent in modern data infrastructure. The repository explores the mechanics of distributed data management, including strategies for replication, partitioning, and achieving consensus across multiple nodes. It details the design of storage engines, indexing techniques, and transaction management models, whi

    Provides methods for redistributing partitioned data across nodes to ensure related records are grouped for processing.

    Pythonbookdatabaseddia
    在 GitHub 上查看↗22,648
  • apache/druidapache 的头像

    apache/druid

    14,020在 GitHub 上查看↗

    Apache Druid is a real-time analytics database and distributed columnar time-series store designed for sub-second analytical queries. It functions as a data platform featuring a distributed SQL query engine and a real-time data ingestion system for moving historical and streaming data from external sources. The system is distinguished by its ability to provide low-latency analytics under high concurrency to power operational dashboards. It implements a Kerberos-secured environment for user authentication and employs a shared-nothing cluster architecture to enable horizontal scaling. The plat

    Implements range-based shuffling of intermediate results across worker nodes to optimize data locality.

    Javadruid
    在 GitHub 上查看↗14,020
  • jerrylead/sparkinternalsJerryLead 的头像

    JerryLead/SparkInternals

    5,363在 GitHub 上查看↗

    SparkInternals 是一份技术参考和架构指南,详细介绍了 Apache Spark 分布式计算引擎的内部设计和实现。它作为大数据引擎分析的研究资料,重点关注系统如何管理集群执行以及驱动节点(Driver)、执行器(Executor)和工作节点(Worker)之间的交互。 该项目详细分解了逻辑计划如何转换为物理执行阶段。它专门分析了数据 Shuffle 操作、内存管理以及分布式作业调度协调的机制。 该文档涵盖了广泛的分布式计算功能,包括查询执行规划、数据依赖管理和内存缓存策略。它还研究了任务分配、并行执行以及用于故障恢复和数据持久化的过程。

    Implements data shuffling to redistribute partitioned data across worker nodes via intermediate disk files.

    在 GitHub 上查看↗5,363
  1. Home
  2. Data & Databases
  3. Data Shuffling Algorithms

探索子标签

  • Incremental Shuffle AggregationsProcessing records incrementally using hash maps during the shuffle retrieval process to optimize memory. **Distinct from Data Shuffling Algorithms:** Focuses on the incremental processing of data during the shuffle phase, not just the redistribution algorithm.