103 search results - page 1 / 21 » Direct Algorithms for Computing the Transitive Closure of Da... |
91
Voted
VLDB
1987
ACM
15 years 7 months ago
1987
ACM
93
Voted
MFDBS
1989
15 years 7 months ago
1989
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
135
Voted
CCS
2007
ACM
15 years 9 months ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
105
Voted
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
111
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...