148 search results - page 2 / 30 » On the extender algebra being complete |
ICDE
1994
IEEE
13 years 10 months ago
1994
IEEE
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
VLDB
1989
ACM
13 years 9 months ago
1989
ACM
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
CN
2006
13 years 5 months ago
2006
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
VLDB
1992
ACM
13 years 9 months ago
1992
ACM
We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is basedon Dempster-Shafertheory which has become popular in ...