An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Parallel evaluation of the transitive closure of a database relation
International Journal of Parallel Programming
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
Parallel processing of recursive queries in distributed architectures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Distributed transitive closure computations: the disconnection set approach
Proceedings of the sixteenth international conference on Very large databases
A framework for the parallel processing of Datalog queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
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
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Parallel hierarchical evaluation of transitive closure queries
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
A Suitable Algorithm for Computing Partial Transitive Closures in Databases
Proceedings of the Sixth International Conference on Data Engineering
Parallel Computation of Direct Transitive Closures
Proceedings of the Seventh International Conference on Data Engineering
Data fragmentation for parallel transitive closure strategies
Proceedings of the Ninth International Conference on Data Engineering
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index
Proceedings of the Ninth International Conference on Data Engineering
The Efficient Computation of Strong Partial Transitive-Closures
Proceedings of the Ninth International Conference on Data Engineering
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A systematic approach to the integration of overlapping partitions in service-oriented data grids
Future Generation Computer Systems
| Hi-index | 0.00 |
In a distributed environment, it is advantageous to fragment a relation and store the fragments at various sites. In this paper, based on the concept of lattice structures, we develop a framework to study the fragmentation problems of distributed recursive relations. Two of the fragmentation problems are how to describe and identify fragments. Description and identification methods previously suggested are more suitable in parallel environments than in distributed databases. We propose a method to describe and identify fragments based on lattice structures. Finding lattice descriptions of fragments is shown to be an NP-complete problem. We analyze the performance of lattice approach both theoretically and experimentally. This is done by creating a database of recursive relations. The empirical analysis shows that our proposed algorithms give near-optimal solutions.