Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Description and Identification of Distributed Fragments of Recursive Relations
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Building knowledge base management systems
The VLDB Journal — The International Journal on Very Large Data Bases
Processing independent and inter-linked documents in XML databases
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
| Hi-index | 0.00 |
The performances of several algorithms suitable for processing an important class of recursive queries called the instantiated transitive closure (TC) queries are studied and compared. These algorithms are the wavefront, delta -wavefront, and a generic algorithm called super-TC. During the evaluation of a TC query, the first two algorithms may read a given disk page more than once, whereas super-TC reads the disk page at most once. A comprehensive performance evaluation of these three algorithms using rigorous analytical and simulation models is presented. The study reveals that the relative performance of the algorithms is a strong function of the parameters which characterize the processed TC query and the relation referenced by that query. The superiority of one of the super-TC variants over all of the other presented algorithms is shown.