mit-pdos/noria

Add support for range indices and operations

Open

#93 创建于 2018年9月19日

在 GitHub 查看
 (0 评论) (0 反应) (0 负责人)Rust (4,576 star) (229 fork)batch import
enhancementhelp wantedm-materializationm-partialm-sql

描述

We currently only have HashMap-based indices, which only support single-key lookups. This precludes support for things like a < ? or even doing multi-backfills by key ranges. We should fix this.

贡献者指南

技术栈
rust
领域
backenddatabase
议题类型
feature
难度面向新贡献者的预计实现难度，1 表示很小改动，5 表示专家级工作。
4
预计时间有经验贡献者完成调查、实现、测试并准备 pull request 的粗略时间范围。
over 1 week
活动状态议题当前的可参与程度：新鲜、活跃、陈旧、阻塞或等待维护者输入。
stale
清晰度议题是否清楚说明期望改动、验收标准和下一步。
mostly clear
前置要求
Rust programmingData structure knowledgeFamiliarity with Noria internals
新手友好度1-100 的估计分数，表示该议题对首次贡献者的友好程度。
15
研究方向
First, examine the existing HashMap based index implementation in the Noria codebase, likely in files related to storage or indexing. Understand the current single key lookup mechanism and dataflow. Then, propose a design for range queries (e.g., B tree or sorted index) that supports operations like `a < ?` and multi backfills. Discuss the design on the issue before implementing. Consider performance implications and integration with the existing partial state dataflow.