Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

Voted

VLDB
1987
ACM

63views Database» more VLDB 1987»

Direct Algorithms for Computing the Transitive Closure of Database Relations

15 years 6 months ago

Direct Algorithms for Computing the Transitive Closure of Database Relations

Download www.vldb.org

Rakesh Agrawal, H. V. Jagadish

Real-time Traffic

Database | VLDB 1987 |

claim paper

Related Content

» Transitive Closure and the LOGAStrategy for its Efficient Evaluation

» Managing RBAC states with transitive relations

» Estimating the Size of Generalized Transitive Closures

» Iterating Octagons

» Data fragmentation for parallel transitive closure strategies

» Computing the Transitive Closure of a Union of Affine Integer Tuple Relations

» Lower Bounds for Local Monotonicity Reconstruction from TransitiveClosure Spanners

» Computing labelconstraint reachability in graph databases

» XPath transitive closure logic and nested tree walking automata

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	VLDB
Authors	Rakesh Agrawal, H. V. Jagadish

Comments (0)