R. Agrawal, H.V. Jagadish  Home/Search
Context Related
Links: ACM DBLP | att.com/dist/db/attdb903.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms perform better than existing transitive closure algorithms, including matrix-based algorithms that divide a matrix into stripes or into square blocks, and graph-based algortihms. We also discuss how this family of algorithms can be generalized to solve path problems and to solve problems in which some selection criteria have been specified for source or destination... (Update)
Context of citations to this paper: More
.... domain centers is precomputed and compressed using the techniques described in [2, 3, 21] Efficient techniques, such as those described in [4, 5], may be used for computing the shortest distances. In addition, the shortest distance between each node and its domain center (and...
.... the class of linear recursive rules has been much studied ( 12, 13] among others) as have transitive closure algorithms and operators ([1, 2, 3] among others) and there are refinements to the magic set transformation which may be applied in such cases [12] Such methods are...
Cited by: More
ConceptBase - A Deductive Object Base - Jarke, Eherer, Gallersdorfer.. (1993) (Correct)
Path Computation in Advanced Traveler Information Systems - Shekhar, Fetterer (1996) (Correct)
Hierarchical Encoded Path Views for Path Query.. - Jing, Huang.. (1998) (Correct)
Active bibliography (related documents): More All
1.0: Algorithms For Searching Massive Graphs - Agrawal, Jagadish (1994) (Correct)
0.7: Transitive closure algorithm DISK_TC and its.. - Hirvisalo, Nuutila, .. (Correct)
0.7: A Direct Algorithm for Computing the Transitive Closure of a.. - Taylor, Nabil (1991) (Correct)
Similar documents based on text: More All
0.1: Efficient Retrieval of Similar Time Sequences Using DFT - Rafiei, Mendelzon (1998) (Correct)
0.1: Similarity of Attributes by External Probes - Gautam Das (1997) (Correct)
0.1: Integrating Association Rule Mining Algorithms With.. - Hipp, Güntzer, Grimmer (2001) (Correct)
Related documents from co-citation: More All
8: Transitive closure algorithms based on graph traversal (context) - Ioannidis, Ramakrishnan et al. - 1993
8: Efficient Transitive Closure Algorithms (context) - Ioannidis, Ramakrishnan - 1988
8: Direct Transitive Closure Algorithms: Design and Performance Evaluation (context) - Agrawal, Dar et al. - 1990
BibTeX entry: (Update)
Agrawal, R. and Jagadish, H. V., "Hybrid Transitive Closure Algorithms," Proc. of the 16th VLDB Conf., Brisbane, Australia, 1990, pp. 326 -- 334. http://citeseer.ist.psu.edu/agrawal90hybrid.html More
@inproceedings{ agrawal90hybrid,
author = "Rakesh Agrawal and H. V. Jagadish",
title = "Hybrid Transitive Closure Algorithms",
booktitle = "The {VLDB} Journal",
pages = "326-334",
year = "1990",
url = "citeseer.ist.psu.edu/agrawal90hybrid.html" }
Citations (may not include all citations):405 Depth-First Search and Linear Graph Algorithms (context) - Tarjan - 1972 DBLP
86 A Theorem on Boolean Matrices (context) - Warshall - 1962 ACM DBLP
62 The Transitive Reduction of a Directed Graph (context) - Aho, Garey et al. - 1972 DBLP
42 Naive Evaluation of Recursively Defined Relations (context) - Bancilhon - 1985 ACM DBLP
27 An Efficient Transitive Closure Algorithm (context) - Ioannidis, Ramakrishnan - 1988
22 the Computation of the Transitive Closure of Relational Oper.. (context) - Ioannidis - 1986
19 Evaluation of Recursive Queries Using Join Indices (context) - Valduriez, Boral - 1986 DBLP
19 Aggregative Closure: An Extension of Transitive Closure (context) - Cruz, Norvell - 1989 DBLP
18 Traversal Recursion: A Practical Approach to Supporting Recu.. (context) - Rosenthal, Heiler et al. - 1986
17 A Study of Transitive Closure as a Recursion Mechanism (context) - Jagadish, Agrawal et al. - 1987 ACM DBLP
16 A Suitable Algorithm for Computing Partial Transitive Closur.. (context) - Jiang - 1990 ACM DBLP
13 New Strategies for Computing the Transitive Closure of a Dat.. (context) - Lu - 1987 ACM DBLP
12 Heuristic Search in Data Base Systems (context) - Kung, Hanson et al. - 1984 DBLP
11 Relational Information System (context) - Merrett - 1984
11 A Modification of Warshall's Algorithm for the Transitive Cl.. (context) - Warren - 1975 ACM DBLP
10 An Improved Transitive Closure Algorithm (context) - Schmitz - 1983 DBLP
10 A Transitive Closure Algorithm (context) - Purdom - 1970 DBLP
9 A Generalized Transitive Closure for Relational Queries (context) - Sippu, Soisalon-Soininen - 1988 ACM DBLP
9 A Sensitive Transitive Closure Algorithm (context) - Ebert - 1981 DBLP
9 On Computing the Transitive Closure of a Relation (context) - Eve, Kurki-Suonio - 1977 DBLP
3 the Input/Output Complexity of Transitive Closure (context) - Ullman, Yannakakis - 1990
2 An Extended Relational Query Language for Knowledgebase Supp.. (context) - Biskup, Raesch et al. - 1987
2 Making the Partial Transitive Closure an Elementary Database.. (context) - Jiang - 1989 DBLP
1 the Evaluation of Recursion in Deductive Database Systems by.. (context) - Guntzer, Kiessling et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC