552 search results - page 80 / 111 » On the Complexity of Join Predicates |
LOPSTR
1994
Springer
15 years 2 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
87
Voted
VLDB
1992
ACM
15 years 2 months ago
1992
ACM
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
ISSTA
1989
ACM
15 years 2 months ago
1989
ACM
The Inscape Environment research project addresses issues in supporting the development of large systems by large numbers of programmers. One aspect of this research is the ‘‘...
93
Voted
CONCUR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
99
Voted
CINQ
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...