ordinals/ord

Benchmark ordered insertion

Open

#2,358 opened on Aug 23, 2023

View on GitHub
 (0 comments) (1 reaction) (0 assignees)Rust (1,479 forks)github user discovery
good first issue

Repository metrics

Stars
 (3,955 stars)
PR merge metrics
 (Avg merge 15d 21h) (5 merged PRs in 30d)

Description

Per this comment, we should try converting the value cache and range cache from HashMaps to BTreeMaps, to see if ordered insertion into redb on flush improves indexing performance.

Contributor guide

Research direction
Clone the repository, implement the conversion from HashMap to BTreeMap in the value cache and range cache, then run benchmarks to compare performance.
Tech stack
rust
Domain
performance
Issue type
Performance
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Mostly clear
Prerequisites
Rust
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
50