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.
Add support for range indices and operations · mit-pdos/noria#93 | Good First Issue