699 search results - page 34 / 140 » A Computational Model for Functional Logic Deductive Databas... |
GG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...
LPAR
1999
Springer
13 years 11 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
ICDT
2010
ACM
14 years 5 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...