Access Paths for Efficient Ordering with Large Language Models

This paper proposes a budget-aware optimizer for LLM ORDER BY queries, leveraging heuristic rules and LLM-as-Judge evaluation to dynamically select the near-optimal access path. The optimizer achieves ranking accuracy on par with or superior to static methods across various benchmarks.

RSS Score 0 10/12/2026, 4:00:00 AM Original Source
Save an API key to vote.