No description
1d8d46670f
## Verification Summary All components from the Definition of Done have been verified: - ✅ SQLite Backend (SqliteTaskStore) — 2,536 lines, 14 tables - ✅ Redis Backend (RedisTaskStore) — 3,894 lines, 14 tables + Redis keyspace - ✅ TaskStore Trait — 53 methods covering all 14 tables - ✅ Migration Files — 3 migrations (001_initial, 002_feature_tables, 003_task_registry_fields) - ✅ SQLite Tests — 36 tests passing - ✅ Redis Tests — 28 integration tests (testcontainers-based) - ✅ Helm Validation — 5 rules enforcing replicas > 1 → redis - ✅ Restart Resilience — task_survives_store_reopen, all_tables_survive_store_reopen ## 14 Tables Implemented 1. tasks — Miroir task registry 2. node_settings_version — Per-(index, node) settings freshness 3. aliases — Single-target + multi-target aliases 4. sessions — Read-your-writes session pins 5. idempotency_cache — Write deduplication 6. jobs — Background job queue 7. leader_lease — Singleton-coordinator lease 8. canaries — Canary definitions 9. canary_runs — Canary run history 10. cdc_cursors — CDC cursors 11. tenant_map — API-key → tenant mapping 12. rollover_policies — ILM policies 13. search_ui_config — Search UI configuration 14. admin_sessions — Admin UI sessions Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com> |
||
|---|---|---|
| .beads | ||
| .cargo | ||
| .github | ||
| benches | ||
| charts/miroir | ||
| crates | ||
| dashboards | ||
| docs | ||
| k8s | ||
| notes | ||
| scripts | ||
| tests/benches/score-comparability | ||
| .dockerignore | ||
| .editorconfig | ||
| .gitignore | ||
| .needle-predispatch-sha | ||
| 1 | ||
| Cargo.lock | ||
| Cargo.toml | ||
| CHANGELOG.md | ||
| clippy.toml | ||
| Dockerfile | ||
| LICENSE | ||
| miroir.yaml | ||
| README.md | ||
| rust-toolchain.toml | ||
| rustfmt.toml | ||
Miroir
Multi-node Index Replication Orchestrator, Integrated Rebalancing
Miroir is a RAID-like orchestration layer for Meilisearch. It stripes a large index across a fleet of small-RAM Meilisearch nodes with a configurable replication factor, fans out search queries across all shards, and rebalances shard assignments when nodes are added or removed — all using the Meilisearch Community Edition.
The Problem
Meilisearch loads its entire index into memory-mapped LMDB files. A large index that exceeds a single server's available RAM cannot run on that server. The Enterprise Edition's native sharding is gated behind a commercial license. Miroir solves this without it.
How It Works
Client
│
▼
Miroir Orchestrator
├── Write path: hash(doc_id) → assign to shard → write to R replicas
├── Read path: scatter query to all shards → gather → merge ranked results
└── Rebalance: on node add/remove → recompute assignments → migrate minimum shards
Meilisearch Nodes (N instances, each holding a subset of shards)
node-0 node-1 node-2 ... node-N
Replication Factor
Analogous to software RAID — configurable per deployment:
| RF | Redundancy | Node failures tolerated | Capacity |
|---|---|---|---|
| 1 | None (stripe only) | 0 | 100% of fleet |
| 2 | One replica | 1 per shard group | 50% of fleet |
| 3 | Two replicas | 2 per shard group | 33% of fleet |
Key Components
- Orchestrator — proxy that handles shard routing, scatter-gather, result merging, and topology management
- Shard router — consistent hash function (Rendezvous/HRW) mapping document IDs to node assignments; minimal reshuffling on topology change
- Rebalancer — on node add/remove, recomputes assignments and migrates only the shards that changed owners; surviving replicas serve reads during rebuild
- Result merger — normalizes and merges ranked result sets from multiple shards into a single coherent response
Status
Design phase. See docs/ for architecture detail.