All news

MirrorBtr speeds up B-Tree traversals in MySQL InnoDB by adding a learned index alongside the tree instead of replacing it, so transactions and recovery stay untouched while lookups skip most inner nodes.

Evergreen checks claims in LLM-written summaries of tables by compiling each claim into a semantic verification query with citations. It keeps F1 at 0.94 while cutting cost 3.1x through early stopping, relevance sorting and prompt caching.

PRISM is an integer set structure that splits 64-bit keys into prefix segments in a trie with bitmap nodes, pruning whole key ranges during intersection and mapping leaves onto SIMD registers for fast k-way intersection.

The Black-Hole Attack poisons vector databases by inserting a few vectors near the centroid of the stored embeddings. Hubness in high dimensions then pulls them into the top-k for up to 94.4% of queries.

NOMA treats multi-agent LLM pipelines as a query optimization problem, jointly choosing topology, model and execution engine against latency, cost and accuracy instead of hand-wiring fixed agent graphs.