BaCon combines factorized join computation with workload-aware domain quantization to evaluate batches of counting queries 2×–178× faster than independent or post-filtering baselines, without modifying DBMS internals.
Learned Query Optimizer: What is New and What is Next
6 Pith papers cite this work, alongside 47 external citations. Polarity classification is still indexing.
6
Pith papers citing it
47
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 6roles
background 1polarities
background 1representative citing papers
PlanRAG models natural language exploratory reasoning problems as logical query trees, optimizes them via dynamic programming with a multi-dimensional cost model, and executes iterative retrieval-generation over the trees to outperform prior RAG methods on a new dataset.
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.
Injecting a few vectors near the embedding-space centroid can make them appear in top-k results for up to 94.4% of queries via centrality-driven hubness.
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
-
BaCon: Efficient Batch Processing of Counting Queries [Full Version]
BaCon combines factorized join computation with workload-aware domain quantization to evaluate batches of counting queries 2×–178× faster than independent or post-filtering baselines, without modifying DBMS internals.
-
When RAG Meets Query Planning: Logical Query Trees for Resolving Exploratory Reasoning Problems
PlanRAG models natural language exploratory reasoning problems as logical query trees, optimizes them via dynamic programming with a multi-dimensional cost model, and executes iterative retrieval-generation over the trees to outperform prior RAG methods on a new dataset.
-
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.
-
Can You Trust the Vectors in Your Vector Database? Black-Hole Attack from Embedding Space Defects
Injecting a few vectors near the embedding-space centroid can make them appear in top-k results for up to 94.4% of queries via centrality-driven hubness.
-
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.