arXiv (All)
open access
Cost-Aware Optimization for Agentic Query Execution
Classical query optimization searches over algebraically equivalent plans that differ only in cost. This assumption breaks once LLM-backed operators enter the picture: their placement, ordering, and granularity jointly determine both cost and answer quality, and the right choice among the alternativ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- When to Compile a Computer-Use Agent? Measuring Payback and Making Compilation Decisions for Token Efficiency#1187610
- Query Performance Tuning with Optimal Exploration of Optimizer Cost Model Parameter Space#1186921
- Query Performance Tuning with Optimal Exploration of Optimizer Cost Model Parameter Space#1181721
- The "Curse of Knowledge" in LLM Query Simulation: Concept Provenance for Tracing Answer-Side Intrusion#1013670
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
Record · ID 1232760
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive