Injecting a few malicious vectors near the centroid exploits centrality-driven hubness in high-dimensional embeddings, causing them to dominate top-k retrievals in up to 99.85% of cases.
Learned Query Optimizer: What is New and What is Next
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
SOLANET is a distributed GPU toolkit for neighbor graph construction that reports 11X speedup on 512 APUs for 1B points and 6.9X for 2B points.
Proposes Governed Evolving Memory (GEM) as a state-trajectory workload for long-term AI agent memory using four operators and six correctness conditions that record-level systems cannot satisfy.
RELOAD achieves up to 2.4x higher robustness and 3.1x greater efficiency than prior RL-based query optimizers on Join Order Benchmark, TPC-DS, and Star Schema Benchmark.
citing papers explorer
-
Can You Trust the Vectors in Your Vector Database? Black-Hole Attack from Embedding Space Defects
Injecting a few malicious vectors near the centroid exploits centrality-driven hubness in high-dimensional embeddings, causing them to dominate top-k retrievals in up to 99.85% of cases.
-
SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems
SOLANET is a distributed GPU toolkit for neighbor graph construction that reports 11X speedup on 512 APUs for 1B points and 6.9X for 2B points.
-
Is Agent Memory a Database? Rethinking Data Foundations for Long-Term AI Agent Memory
Proposes Governed Evolving Memory (GEM) as a state-trajectory workload for long-term AI agent memory using four operators and six correctness conditions that record-level systems cannot satisfy.
-
RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems
RELOAD achieves up to 2.4x higher robustness and 3.1x greater efficiency than prior RL-based query optimizers on Join Order Benchmark, TPC-DS, and Star Schema Benchmark.