PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
Overbound and right-linear queries
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On tree-based techniques for query evaluation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Performance evaluation of algorithms for transitive closure
Information Systems
Augmenting databases with generalized transitive closure
Augmenting databases with generalized transitive closure
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Suitable Algorithm for Computing Partial Transitive Closures in Databases
Proceedings of the Sixth International Conference on Data Engineering
A Spanning Tree Transitive Closure Algorithm
Proceedings of the Eighth International Conference on Data Engineering
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index
Proceedings of the Ninth International Conference on Data Engineering
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A vision for management of complex models
ACM SIGMOD Record
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation
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
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On the computation of recursion in relational databases
Effective databases for text & document management
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
Efficient allocation algorithms for OLAP over imprecise data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
OLAP over imprecise data with domain constraints
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Map-reduce extensions and recursive queries
Proceedings of the 14th International Conference on Extending Database Technology
Cluster computing, recursion and datalog
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
We present a comprehensive performance evaluation of transitive closure (reachability) algorithms for databases. The study is based upon careful implementations of the algorithms, measures page I/O, and covers algorithms for full transitive closure as well as partial transitive closure (finding all successors of each node in a set of given source nodes). We examine a wide range of acyclic graphs with varying density and “locality” of arcs in the graph. We also consider query parameters such as the selectivity of the query, and system parameters such as the buffer size and the page and successor list replacement policies. We show that significant cost tradeoffs exist between the algorithms in this spectrum and identify the factors that influence the performance of the algorithms.An important aspect of our work is that we measure a number of different cost metrics, giving us a good understanding of the predictive power of these metrics with respect to I/O cost. This is especially significant since metrics such as number of tuples generated or number of successor list operations have been widely used to compare transitive closure algorithms in the literature. Our results strongly suggest that these other metrics cannot be reliability used to predict I/O cost of transitive closure evaluation.