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...
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...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
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...
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...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
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...