Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Boolean_conjunctive_query> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Boolean_conjunctive_query abstract "In the theory of relational databases, a Boolean conjunctive query is a conjunctive query without distinguished predicates, i.e., a query in the form , where each is a relation symbol and each is a tuple of variables and constants; the number of elements in is equal to the arity of . Such a query evaluates to either true or false depending on whether the relations in the database contains the appropriate tuples of values.As an example, if a database schema contains the relation symbols (binary, who's the father of whom) and (unary, who is employed), a conjunctive query could be . This query evaluates to true if there exists an individual who is a child of Mark and employed. In other words, this query expresses the question: "does Mark have employed children?"".
- Boolean_conjunctive_query wikiPageID "12324910".
- Boolean_conjunctive_query wikiPageRevisionID "300523273".
- Boolean_conjunctive_query hasPhotoCollection Boolean_conjunctive_query.
- Boolean_conjunctive_query subject Category:Boolean_algebra.
- Boolean_conjunctive_query comment "In the theory of relational databases, a Boolean conjunctive query is a conjunctive query without distinguished predicates, i.e., a query in the form , where each is a relation symbol and each is a tuple of variables and constants; the number of elements in is equal to the arity of .".
- Boolean_conjunctive_query label "Boolean conjunctive query".
- Boolean_conjunctive_query sameAs m.02v_9sy.
- Boolean_conjunctive_query sameAs Q4943354.
- Boolean_conjunctive_query sameAs Q4943354.
- Boolean_conjunctive_query wasDerivedFrom Boolean_conjunctive_query?oldid=300523273.
- Boolean_conjunctive_query isPrimaryTopicOf Boolean_conjunctive_query.