4397 search results - page 312 / 880 » Relational Algebra Operations |
168
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
193
click to vote
SAS
1992
Springer
15 years 8 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
150
click to vote
PODS
2012
ACM
13 years 7 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
136
Voted
DEBU
2008
15 years 4 months ago
2008
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
146
click to vote
SRDS
1999
IEEE
15 years 9 months ago
1999
IEEE
In our paper we argue that the building of trust in electronic commerce depends only partly on technical security and the knowledge of security gaps and ways of closing them. It i...