Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Clustering a DAG for CAD Databases
IEEE Transactions on Software Engineering
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
An incremental join attachment for Starburst
Proceedings of the sixteenth international conference on Very large databases
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
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
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Layered index structures in document database systems
Proceedings of the seventh international conference on Information and knowledge management
On extending the functions of a relational database system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Path Signatures: A Way to Speed Up Recursion in Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
Hi-index | 0.00 |
A composite object represented as a directed graph is an important data structure which requires efficient support in CAD/CAM, CASE, office systems, software management, Web databases and document databases. It is cumbersome to handle such an object in relational database systems when it involves recursive relationships. In this chapter, we present a new encoding method to support the efficient computation of recursion. In addition, we devise a linear time algorithm to identify a sequence of reachable trees (w.r.t.) a directed acyclic graph (DAG), which covers all the edges of the graph. Together with the new encoding method, this algorithm enables us to compute recursion w.r.t, a DAG in time O(e), where e represents the number of edges of the DAG. More importantly, this method is especially suitable for a relational environment.