First-order queries on structures of bounded degree are computable with constant delay.
Arnaud DurandEtienne GrandjeanPublished in: ACM Trans. Comput. Log. (2007)
Keyphrases
- query processing
- query language
- response time
- query evaluation
- probabilistic databases
- user queries
- range queries
- bounded degree
- database queries
- first order logic
- graph theoretic
- higher order
- database
- web search engines
- relational learning
- data objects
- data sources
- special case
- data model
- information retrieval
- databases