Efficient Path Query Processing in Relational Database Systems

arXiv:2604.02553 · cs.DB · Submitted 2026-04-02 · Read on arXiv

cs.DB

Submitted: 2026-04-02

Updated: 2026-10-21

Terminology

• Abstraction — 1× in this paper · explained in 1 episode

Related papers

• SAGA: Synthetic Agentic Graph Architecture for Temporal Benchmark Generation
• Cost-Aware Mixture-of-Experts Coordination for Model Markets
• Amora: Communication-Efficient Private Approximate Nearest Neighbors Search
• Vibe Coding on Trial: Operating Characteristics of Unanimous LLM Juries
• Human-Level Text-to-SQL via Reinforcement Learning on Verified Data, Without Pipeline Engineering
• MetaJoin: Adaptive Join Selections for Heterogeneous Tables