VLDB
1989
ACM
13 years 9 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...
MFDBS
1989
13 years 9 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...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
ICALP
2009
Springer
13 years 9 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
We present Transitive Closure based visual word formation technique for obtaining robust object representations from smoothly varying multiple views. Each one of our visual words ...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
ESWS
2009
Springer
13 years 11 months ago
2009
Springer
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...