Ketebe / Benchmarks

Benchmarks

Ketebe will not market latency, throughput, scale or cost numbers without a workload definition that other people can reproduce.

Why this page exists

Retrieval systems are unusually easy to benchmark badly. Index shape, vector dimensions, metadata selectivity, fusion strategy, reranking, ingestion pressure, hardware, durability settings and cache warmth can all change the result. Ketebe treats benchmark methodology as part of the product contract.

Benchmark profiles

SearchRetrieval latency

Dense, sparse and hybrid query profiles with explicit dataset shape, top-k, filters, fusion and reranking behavior.

Write pathIngestion throughput

Record and document ingestion under defined durability, embedding and indexing conditions.

OperationsRecovery

Restart, crash recovery and rebuild time with known WAL and segment state.

ConcurrencyMixed workloads

Search while writes, async jobs or continuous ingestion are active instead of testing isolated happy paths only.

What a credible result must include

  • Ketebe version and commit.
  • CPU, memory, storage and deployment topology.
  • Dataset size, vector dimensions and metadata shape.
  • Query mix, top-k and search profile configuration.
  • Warm-up method and run duration.
  • Latency percentiles, throughput and error rate together.
  • Any background ingestion, embedding, compaction or recovery activity.

Current status

No marketing benchmark numbers yet. v0.9 focuses on packaging and release readiness. Repeatable public benchmark profiles are part of the evidence path toward v1.0. This page exists now so future numbers have a stable methodology rather than appearing as context-free homepage claims.