Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The Join Algorithms on a Shared-Memory Multiprocessor Database Machine
IEEE Transactions on Software Engineering
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
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Efficient Algorithms for the Instantiated Transitive Closure Queries
IEEE Transactions on Software Engineering
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data & Knowledge Engineering
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)
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Processing and Evaluation of Transitive Closure Queries
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
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
The Efficient Computation of Strong Partial Transitive-Closures
Proceedings of the Ninth International Conference on Data Engineering
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference 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 development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms.