On the optimal approximation of queries using tractable propositional languages.
Robert FinkDan OlteanuPublished in: ICDT (2011)
Keyphrases
- query language
- query processing
- web search engines
- closed form
- expressive power
- user queries
- database
- first order logic
- computational complexity
- query evaluation
- databases
- database query languages
- exact computation
- propositional logic
- range queries
- dynamic programming
- search engine
- retrieval systems
- response time
- error bounds
- query answering
- approximation algorithms
- natural language
- computationally tractable
- error tolerance
- optimal solution