iqdb-cache 0.3.0

In-process vector and result caching with LRU/LFU/ARC eviction - part of the iQDB family.
Documentation
  • Transparent wrapper — CachedIndex<I> implements IndexCore, so it slots in anywhere the wrapped index does, including behind Box<dyn IndexCore>
  • Result memoization — identical searches (same query, same SearchParams) are served from an in-memory cache instead of re-running
  • Mutation-exact invalidation — every insert / insert_batch / delete clears the cache, so a search never observes a stale result
  • Optional TTL — give entries an expiry to bound staleness from changes the wrapper can't see; off by default, and verified deterministically with a mock clock
  • Bounded LRU — an arena-backed least-recently-used cache with amortized O(1) lookup, insert, and eviction; the footprint never exceeds the configured capacity
  • Off by default — size the cache, or disable it with capacity 0 for a pure passthrough to A/B the cache's effect without touching call sites
  • Hit/miss stats — CacheStats exposes lifetime hit and miss counters plus a hit_rate for tuning
  • Zero unsafe — the whole crate is #![forbid(unsafe_code)]

Installation

[dependencies]
iqdb-cache = "0.3"

Quick start

Wrap any index and let repeated searches come from memory:

use iqdb_cache::CachedIndex;
use iqdb_index::IndexCore;
use iqdb_types::{DistanceMetric, SearchParams};

// `stub_index()` stands in for a real `iqdb-flat` / `iqdb-hnsw` index.
let cached = CachedIndex::new(iqdb_cache::doc_stub::stub_index());
let params = SearchParams::new(3, DistanceMetric::Cosine);

let cold = cached.search(&[1.0, 0.0, 0.0], &params).expect("search");
let warm = cached.search(&[1.0, 0.0, 0.0], &params).expect("search"); // served from cache
assert_eq!(cold, warm);

let stats = cached.cache_stats();
assert_eq!(stats.hits, 1);
assert_eq!(stats.misses, 1);

Size the cache, or disable it entirely:

use iqdb_cache::CachedIndex;

// Hold the 4096 most-recent distinct searches.
let sized = CachedIndex::with_capacity(iqdb_cache::doc_stub::stub_index(), 4096);
assert_eq!(sized.capacity(), 4096);

// Capacity 0 is a pure passthrough — useful for measuring the cache's effect.
let bypass = CachedIndex::with_capacity(iqdb_cache::doc_stub::stub_index(), 0);
assert!(!bypass.is_enabled());

A write invalidates the cache, so the next search reflects it — never a stale result:

use std::sync::Arc;

use iqdb_cache::CachedIndex;
use iqdb_index::IndexCore;
use iqdb_types::{DistanceMetric, SearchParams, VectorId};

let mut cached = CachedIndex::new(iqdb_cache::doc_stub::stub_index());
let params = SearchParams::new(10, DistanceMetric::Cosine);

let before = cached.search(&[0.0, 0.0, 0.0], &params).expect("search");
cached
    .insert(VectorId::from(42u64), Arc::from(&[0.0, 0.0, 0.0][..]), None)
    .expect("insert");
let after = cached.search(&[0.0, 0.0, 0.0], &params).expect("search");

// The new vector is visible immediately; the cached result was discarded.
assert_eq!(after.len(), before.len() + 1);

Give entries a time-to-live to bound staleness from changes made behind the wrapper's back — through a CacheConfig (the Tier-2 path):

use std::time::Duration;

use iqdb_cache::{CacheConfig, CachedIndex};

let config = CacheConfig::new()
    .capacity(4096)
    .ttl(Duration::from_secs(300)); // results reused within 5 min are hits

let cached = CachedIndex::with_config(iqdb_cache::doc_stub::stub_index(), config);
assert_eq!(cached.ttl(), Some(Duration::from_secs(300)));

Errors

CachedIndex introduces no errors of its own: every fallible call forwards the wrapped index's iqdb_types::Result unchanged. A search that errors is not cached, so a later identical search re-runs against the index.

Status

v0.3.0 — the CachedIndex wrapper, the bounded LRU result cache with mutation-exact invalidation, and an optional per-entry TTL (via clock-lib, so expiry is tested deterministically with a mock clock). Every core invariant is property-tested against a brute-force reference index (the cache is transparent; a write is never stale), concurrent reads are covered, and the hit path is benchmarked: on the reference machine a 10k-vector / dim-64 search costs ~234 µs uncached versus ~238 ns from cache — a ~985× speedup — with a TTL adding ~29 ns for the clock read. Additional eviction policies (LFU / FIFO / ARC) and loom concurrency model-checks land across the rest of the 0.x series per the ROADMAP. The full surface is documented in docs/API.md.

Where It Fits

iqdb-cache sits above the index family and below the database. It builds on:

  • iqdb-types — core types (VectorId, Hit, SearchParams, DistanceMetric, Filter)
  • iqdb-index — the IndexCore trait it wraps
  • iqdb — exposes caching via the database builder

It is unblocked today: its first-party dependencies (iqdb-types, iqdb-index, and clock-lib for TTL) are all stable at 1.0.

Standards

Built to the iQDB Rust standard. See REPS.md (Rust Efficiency & Performance Standards) and dev/DIRECTIVES.md for the engineering law and the definition of done. Before a PR: cargo fmt --all, cargo clippy --all-targets --all-features -- -D warnings, and cargo test --all-features must be clean.