tursodatabase/turso

Concurrent B-tree search with asynchronous I/O

Open

#2,664 opened on Aug 19, 2025

View on GitHub
 (0 comments) (5 reactions) (0 assignees)Rust (1,001 forks)github user discovery
enhancementhelp wantedperformance

Repository metrics

Stars
 (19,103 stars)
PR merge metrics
 (Avg merge 2d 11h) (147 merged PRs in 30d)

Description

There are various proposed optimizations to leverage asynchronous I/O for concurrent b-tree search at least. Let's look into them.

Contributor guide

Research direction
Research concurrent b tree search optimization techniques using asynchronous I/O, analyze existing proposals, implement prototype, and benchmark.
Tech stack
rust
Domain
database
Issue type
Research
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
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.
Needs investigation
Prerequisites
Rustdatabase internals
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
30