Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Boolean conjunctive query (view)

searching for Conjunctive query 6 found (23 total)

alternate case: conjunctive query

Phokion G. Kolaitis (630 words) [view diff] no match in snippet view article find links to article

RJ Miller, L Popa, Theoretical Computer Science 336 (1), 89-124 Conjunctive-query containment and constraint satisfaction, PG Kolaitis, MY Vardi, Journal
Complexity of constraint satisfaction (4,485 words) [view diff] exact match in snippet view article find links to article
Since the homomorphism problem is equivalent to conjunctive query evaluation and conjunctive query containment, these two problems are equivalent to
Datablitz (683 words) [view diff] exact match in snippet view article find links to article
Navigation is supported through iterators over a single table. A conjunctive query may be specified for the iterator, and automatic index selection is
Extended Boolean model (1,040 words) [view diff] exact match in snippet view article find links to article
include p-distances, where 1 ≤ p ≤ ∞ is a new parameter. A generalized conjunctive query is given by: q o r = k 1 ∨ p k 2 ∨ p . . . . ∨ p k t {\displaystyle
Knowledge-based recommender system (899 words) [view diff] exact match in snippet view article find links to article
implemented on the basis of constraint search or different types of conjunctive query-based approaches. In a navigation-based recommender, user feedback
RDFLib (3,185 words) [view diff] case mismatch in snippet view article find links to article
a Formula-aware store behaves the same as a Context-aware store. Conjunctive Query Any query that doesn't limit the store to search within a named context