mit-pdos/noria

Add support for range indices and operations

Open

#93 opened on Sep 19, 2018

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Rust (4,576 stars) (229 forks)batch import
enhancementhelp wantedm-materializationm-partialm-sql

Description

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.

Contributor guide

Tech stack
rust
Domain
backenddatabase
Issue type
feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
4
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
over 1 week
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
mostly clear
Prerequisites
Rust programmingData structure knowledgeFamiliarity with Noria internals
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
15
Research direction
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.