Name
Abstract | ||
|---|---|---|
this paper we focus our discussion on constraints expressed as conjunctive queries witharithmetic comparisons, we suppose the only accessible relation is the updated relation, and weconsider updates that are insertions of a single tuple. The general form of a conjunctive queryconstraint is: |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58601-6_99 | PPCP |
Keywords | Field | DocType |
database integrity constraint checking,complete tests,conjunctive queries,database integration | Graph database,Conjunctive query,Programming language,Deductive database,Computer science,Database design,Database schema,Data integrity,Database theory,Constraint logic programming | Conference |
ISBN | Citations | PageRank |
3-540-58601-6 | 2 | 0.93 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashish Gupta | 1 | 292 | 56.19 |
| Yehoshua Sagiv | 2 | 5362 | 1575.95 |
| Jeffrey D. Ullman | 3 | 13099 | 5226.28 |
| Jennifer Widom | 4 | 16150 | 2524.75 |