699 search results - page 2 / 140 » Strong types for relational databases |
COMAD
2008
13 years 6 months ago
2008
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
LFCS
1994
Springer
13 years 8 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
ENTCS
2007
13 years 4 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
JUCS
2010
12 years 11 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
ICDE
1995
IEEE
14 years 5 months ago
1995
IEEE
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...