Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q18206865> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- Q18206865 subject Q7217201.
- Q18206865 subject Q8363916.
- Q18206865 abstract "In relational database theory, an equality-generating dependency (EGD) is a certain kind of constraint on data. It is a subclass of the class of embedded dependencies (ED). An ED is a sentence in first-order logic of the form:∀x1 ... xn, P(x1, ..., xn) → ∃z1, ..., zk, Q(y1, ..., ym)where {z1, ..., zk} = {y1, ..., ym} \ {x1, ..., xn}, and P is a possibly empty and Q is a non-empty conjunction of equality atoms. A n equality atom has the form wi = wj where each of the w, ..., wh, wi, wj, are variables or constants. An algorithm known as the chase takes as input an instance that may or may not satisfy a set of EGDs (or more generally a set of EDs), and, if it terminates (which is a priori undecidable), output an instance that does satisfy the EGDs.".
- Q18206865 wikiPageExternalLink 305.pdf.
- Q18206865 wikiPageWikiLink Q18206789.
- Q18206865 wikiPageWikiLink Q3479163.
- Q18206865 wikiPageWikiLink Q4809258.
- Q18206865 wikiPageWikiLink Q5087085.
- Q18206865 wikiPageWikiLink Q7217201.
- Q18206865 wikiPageWikiLink Q7926426.
- Q18206865 wikiPageWikiLink Q8363916.
- Q18206865 comment "In relational database theory, an equality-generating dependency (EGD) is a certain kind of constraint on data. It is a subclass of the class of embedded dependencies (ED). An ED is a sentence in first-order logic of the form:∀x1 ... xn, P(x1, ..., xn) → ∃z1, ..., zk, Q(y1, ..., ym)where {z1, ..., zk} = {y1, ..., ym} \ {x1, ..., xn}, and P is a possibly empty and Q is a non-empty conjunction of equality atoms.".
- Q18206865 label "Equality-generating dependency".