Our approach is intended to show the existence, in the presence of inheritance, of a typable and complete database query language
. This is interesting, because it is not obvious that typing, inheritance, and completeness are all compatible notions.
The approach enables grid applications to query data such web databases using a standard database query language
We consider disjunctive Datalog, a powerful database query language
based on disjunctive gic programming.
We then define an extended relational calculus as the theoretical basis for our|1NF database query language
. We define a minimal extended relational algebra and prove its equivalence to the|1NF relational calculus.
This framework has implications for database query language