Design and implementation of the Wisconsin storage system
Software—Practice & Experience
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Relational Information Systems
Relational Information Systems
Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Incorporating hierarchy in a relational model of data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Journal of the ACM (JACM)
A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Composition of Database Relations
Proceedings of the Fifth International Conference on Data Engineering
Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation
Proceedings of the Third International Conference on Data Engineering
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
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)
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Incomplete path expressions and their disambiguation
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Path queries for transportation networks: dynamic reordering and sliding window paging techniques
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
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
Description and Identification of Distributed Fragments of Recursive Relations
IEEE Transactions on Knowledge and Data Engineering
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
Efficient transitive closure reasoning in a combined class/part/containment hierarchy
Knowledge and Information Systems
Extending SQL with Generalized Transitive Closure
IEEE Transactions on Knowledge and Data Engineering
Hybrid Transitive Closure Algorithms
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
On Maintaining Priorities in a Production Rule System
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
On the computation of recursion in relational databases
Effective databases for text & document management
On semantic matching of multilingual attributes in relational systems
Proceedings of the thirteenth ACM international conference on Information and knowledge management
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient allocation algorithms for OLAP over imprecise data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Computing SSA Form with Matrices
Electronic Notes in Theoretical Computer Science (ENTCS)
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
OLAP over imprecise data with domain constraints
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Preserving confidentiality of security policies in data outsourcing
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Virtual social networks online and mobile systems
Mobile Information Systems
Processing independent and inter-linked documents in XML databases
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
NCSU: Modeling temporal relations with Markov logic and lexical ontology
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
IWTrust: improving user trust in answers from the web
iTrust'05 Proceedings of the Third international conference on Trust Management
Cache based approach for improving location based query processing in mobile environment
Proceedings of the First International Conference on Security of Internet of Things
| Hi-index | 0.00 |
We present new algorithms for computing transitive closure of large database relations. Unlike iterative algorithms, such as the seminaive and logarithmic algorithms, the termination of our algorithms does not depend on the length of paths in the underlying graph (hence the name direct algorithms). Besides reachability computations, the proposed algorithms can also be used for solving path problems. We discuss issues related to the efficient implementation of these algorithms, and present experimental results that show the direct algorithms perform uniformly better than the iterative algorithms. A side benefit of this work is that we have proposed a new methodology for evaluating the performance of recursive queries.