Bounding Queries in the Analytic Polynomial-Time Hierarchy.
Herbert BaierKlaus W. WagnerPublished in: Theor. Comput. Sci. (1998)
Keyphrases
- query language
- query complexity
- query processing
- exact learning
- special case
- efficient processing
- database
- user defined
- database queries
- query logs
- query evaluation
- range queries
- web search engines
- response time
- user queries
- upper bound
- data sources
- retrieval systems
- search queries
- equivalence queries
- dnf formulas
- query optimization
- hierarchical structure
- worst case
- membership queries
- computational complexity