A tight bound for the clique query problem in two rounds.
Uriel FeigeTom FersterPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- worst case
- database
- response time
- query processing
- query evaluation
- range queries
- query formulation
- keywords
- generalization error bounds
- relevance feedback
- efficient processing
- data structure
- complex queries
- retrieval method
- keyword search
- retrieval systems
- vector space
- query expansion
- error bounds
- user defined
- search queries
- indexing techniques
- cost model
- user queries
- user interaction
- data sources
- bayesian networks