The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation.
Ismail H. Toroslu, Ghassan Z. Qadah:
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation.
IEEE Trans. Knowl. Data Eng. 8(4): 617-629(1996)@article{DBLP:journals/tkde/TorosluQ96,
author = {Ismail H. Toroslu and
Ghassan Z. Qadah},
title = {The Strong Partial Transitive-Closure Problem: Algorithms and
Performance Evaluation},
journal = {IEEE Trans. Knowl. Data Eng.},
volume = {8},
number = {4},
year = {1996},
pages = {617-629},
ee = {db/journals/tkde/TorosluQ96.html, db/journals/tkde/TorosluQ96.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Copyright © 1996 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Edition
under construction (file=TKDE8/k0617.pdf)
BibTeX
References
- [1]
- Rakesh Agrawal, Shaul Dar, H. V. Jagadish:
Direct Transitive Closure Algorithms: Design and Performance Evaluation.
ACM Trans. Database Syst. 15(3): 427-458(1990) BibTeX
- [2]
- Rakesh Agrawal, H. V. Jagadish:
Hybrid Transitive Closure Algorithms.
VLDB 1990: 326-334 BibTeX
- [3]
- François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986: 1-15 BibTeX
- [4]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52 BibTeX
- [5]
- Shaul Dar, H. V. Jagadish:
A Spanning Tree Transitive Closure Algorithm.
ICDE 1992: 2-11 BibTeX
- [6]
- Shaul Dar, Raghu Ramakrishnan:
A Performance Study of Transitive Closure Algorithms.
SIGMOD Conference 1994: 454-465 BibTeX
- [7]
- David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood:
Implementation Techniques for Main Memory Database Systems.
SIGMOD Conference 1984: 1-8 BibTeX
- [8]
- Jiawei Han, Ghassan Z. Qadah, Chinying Chaou:
The Processing and Evaluation of Transitive Closure Queries.
EDBT 1988: 49-75 BibTeX
- [9]
- Yannis E. Ioannidis, Raghu Ramakrishnan:
Efficient Transitive Closure Algorithms.
VLDB 1988: 382-394 BibTeX
- [10]
- Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger:
Transitive Closure Algorithms Based on Graph Traversal.
ACM Trans. Database Syst. 18(3): 512-576(1993) BibTeX
- [11]
- Yannis E. Ioannidis:
On the Computation of the Transitive Closure of Relational Operators.
VLDB 1986: 403-411 BibTeX
- [12]
- H. V. Jagadish:
A Compression Technique to Materialize Transitive Closure.
ACM Trans. Database Syst. 15(4): 558-598(1990) BibTeX
- [13]
- Håkan Jakobsson:
Mixed-Approach Algorithms for Transitive Closure.
PODS 1991: 199-205 BibTeX
- [14]
- Håkan Jakobsson:
On Tree-Based Techniques for Query Evaluation.
PODS 1992: 380-392 BibTeX
- [15]
- Bin Jiang:
A Suitable Algorithm for Computing Partial Transitive Closures in Databases.
ICDE 1990: 264-271 BibTeX
- [16]
- Ghassan Z. Qadah, Lawrence J. Henschen, Jung J. Kim:
Efficient Algorithms for the Instantiated Transitive Closure Queries.
IEEE Trans. Software Eng. 17(3): 296-309(1991) BibTeX
- [17]
- Ghassan Z. Qadah, Jung J. Kim:
The processing of a class of transitive-closure queries on uniprocessor and shared-nothing multiprocessor systems.
Data Knowl. Eng. 8: 57-89(1992) BibTeX
- [18]
- Ghassan Z. Qadah, Keki B. Irani:
The Join Alogorithms on a Shared-Memory Multiprocessor Database Machine.
IEEE Trans. Software Eng. 14(11): 1668-1683(1988) BibTeX
- [19]
- Leonard D. Shapiro:
Join Processing in Database Systems with Large Main Memories.
ACM Trans. Database Syst. 11(3): 239-264(1986) BibTeX
- [20]
- Robert Endre Tarjan:
Depth-First Search and Linear Graph Algorithms.
SIAM J. Comput. 1(2): 146-160(1972) BibTeX
- [21]
- ...
- [22]
- Ismail H. Toroslu, Ghassan Z. Qadah:
The Efficient Computation of Strong Partial Transitive-Closures.
ICDE 1993: 530-537 BibTeX
- [23]
- Ismail H. Toroslu, Ghassan Z. Qadah, Lawrence J. Henschen:
An efficient database transitive closure algorithm.
Appl. Intell. 4(2): 205-218(1994) BibTeX
- [24]
- Jeffrey D. Ullman, Mihalis Yannakakis:
The Input/Output Complexity of Transitive Closure.
SIGMOD Conference 1990: 44-53 BibTeX
- [25]
- Jeffrey D. Ullman, Mihalis Yannakakis:
High-Probability Parallel Transitive-Closure Algorithms.
SIAM J. Comput. 20(1): 100-125(1991) BibTeX
- [26]
- Patrick Valduriez, Haran Boral:
Evaluation of Recursive Queries Using Join Indices.
Expert Database Conf. 1986: 271-293 BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
IEEE Transactions on Data and Knowledge Engineering: Copyright © by IEEE,
Joint ACM SIGMOD / IEEE Computer Society Anthology: Copyright © by ACM (info@acm.org) and IEEE, Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sun May 17 00:28:37 2009