J87-1020 transformation at the time of query evaluation . The transformed query has restrictions
D08-1009 a common phenomena in database query evaluation . Luckily , most relations in
C00-2157 guarantee efficient lookups during the query evaluation . The query processor to date
W15-0407 solution for creating controlled query evaluation mechanisms based on robust approaches
J81-3002 , semantic interpretation and query evaluation are uniformly represented . Formalization
W15-4727 application domain and a continuous query evaluation allows to serve queries such
W11-4102 with respect to reasoning and query evaluation . Each Reason-able View is aiming
E03-1043 top 30 missing lemmas from the query evaluation are neither verbs nor nouns .
W15-0407 results related to controlled query evaluation approaches -- thus relying on
W15-4727 the theoretical foundations for query evaluation with contextual preferences (
W15-0407 between formal ontology , controlled query evaluation , and natural language . 2 Motivation
W15-0407 effective strategies for controlled query evaluation over uncertain knowledge bases
W06-2701 XPath and XQuery , and standard query evaluation engines can not be used with
W06-1665 all the vocabulary ( V ) , the query evaluation will be very time consuming because
J87-1020 addresses the problem of efficient query evaluation over a deductive data base and
P84-1039 , parallel ( coroutine based ) query evaluation , and null values . These problems
N07-1028 estimates of probabilities for query evaluation . The pseudo-relevance feedback
H94-1073 description can be computed before the query evaluation . In particular , an access structure
P10-1014 the grammar invocation and the query evaluation are identical . We now formally
J87-1020 language syntax , a proof ( or query evaluation ) procedure , a description of
hide detail