87 search results - page 3 / 18 » Maintenance of Transitive Closures and Transitive Reductions... |
ICDT
2003
ACM
15 years 4 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
103
click to vote
JDA
2006
14 years 11 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
115
click to vote
ICDE
1993
IEEE
15 years 3 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
102
click to vote
DBPL
1995
Springer
15 years 3 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...