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.
Save an API key to vote.