Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A data management extension architecture
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Clustering a DAG for CAD Databases
IEEE Transactions on Software Engineering
Making database systems fast enough for CAD applications
Object-oriented concepts, databases, and applications
A method for hierarchy processing in relational systems
Information Systems
Signature-based text retrieval methods: a survey
Data Engineering
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)
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
On extending the functions of a relational database system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
The Implementation of POSTGRES
IEEE Transactions on Knowledge and Data Engineering
Implementation Techniques of Complex Objects
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
Object-Oriented Database Systems: Promises, Reality, and Future
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
New Strategies for Computing the Transitive Closure of a Database Relation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Research Frontiers in Object Technology
Information Systems Frontiers
A Linear-Order Based Access Method for Efficient Network Computations
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Efficient Retrieval of Structured Documents From Object-Relational Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Scalable Visual Hierarchy Exploration
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
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
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
Composite objects often involve recursive relationships, so called bills-of-materials, which are cumbersome to handle in relational database systems. The relationships constitute a directed graph, where the successors of a node represent its components, recursively. Instead of the whole transitive closure (all ancestor-descendant pairs), the task is here to retrieve the descendants of any given node. A simple relational solution is suggested, which packs information of the ancestor path of each node into a fixed-length code, called the signature. The code is nonunique, and its purpose is to define a relatively small superset of the descendants, as well as establish a basis for clustering. It supports effective retrieval of the descendants, in terms of both disk accesses and DBMS calls. The method performs best for tree-structured graphs, where the processing time typically decreases by a factor of more than 10, compared to a simple loop of joins. Also general directed graphs, both acyclic and cyclic, can be processed more effectively. The method is implemented on top of a relational system, but advantages can be gained on other platforms, too.