arXiv (All)
open access
When Plans Change Answers: Formalizing Cost-Accuracy Optimization for Semantic Queries
In semantic query engines, predicates are evaluated by machine-learned models, and the choice of a query plan affects not only the cost of a query but also its result. Existing systems either apply a fixed threshold to each semantic operator or tune accuracy per operator, without accounting for how
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 Plans Change Answers: Formalizing Cost-Accuracy Optimization for Semantic Queries#1210392
- Horrila: Cost-Based Placement of Semantic Operators in Hybrid Query Plans#10460
- LOW-LEVEL SEMANTICS AND OPTIMIZATIONS#929449
- CADENZA: Compiling Natural-Language Intent into Task-Specific Operator DAGs for Semantic Query Processing#324988
- Human-like Knowledge Invention: A Non Monotonic Reasoning framework#699174
Record · ID 1217824
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