Task
Query Decomposition
Canonical ID https://id.searchplex.net/query-decomposition/
Breaking a complex query or information need into smaller subqueries or subproblems that can be retrieved or answered separately.
Also called
- Question Decomposition
Scope
Query decomposition is common in multi-hop question answering, agentic retrieval, and complex search tasks. It is distinct from query reformulation, which changes a query, and from query routing, which decides where or how a query should be handled.
Observed terms
- Subquery Generation
- Sub-Question Generation
Part of
Not equivalent to
- Query Decomposition is not Query Reformulation. Query decomposition breaks a complex information need into subqueries; query reformulation changes an existing query to better express or satisfy an information need.
- Query Decomposition is not Query Routing. Query decomposition creates subqueries or subproblems; query routing chooses the handling path or retrieval resource.
- Query Decomposition is not Retrieval Planning. Query decomposition may be one step in a retrieval plan; retrieval planning chooses the overall retrieval strategy or sequence.
Learn more
ID
- Canonical ID
https://id.searchplex.net/query-decomposition/ - Scheme
Searchplex ID - Machine
JSONJSON-LD