The question
How can each event find its latest applicable historical reference record efficiently under skew, updates and out-of-order arrival?
This is a proposed research direction. No novel algorithm, completed benchmark or performance gain is claimed.
Why it matters
Financial analytics, feature platforms and historical reporting rely on correct temporal matching.
Search space
Sorted indexes, batched searches, interval layouts and hot-key handling.
What would count as progress?
- Exact reference results
- throughput
- memory
- p95/p99 latency
- update cost.
A useful result improves a measured trade-off against strong baselines on held-out workloads, with reproducible code and documented limitations.
Baselines and boundaries
Compare sorted merge and per-key binary-search implementations. Specify inclusive boundaries, ties, missing matches, late updates and whether past outputs must be corrected.
Where you could contribute
Help define representative, legally shareable workloads; critique the correctness contract; implement baselines; propose candidates; or reproduce measurements. Negative results and failure cases are useful contributions.
A detailed research brief is being prepared. Access requests will become available when that brief and the request service are ready.