ACM Computing Surveys (CSUR)
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Normalization of relations and PROLOG
Communications of the ACM
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
New methods and fast algorithms for database normalization
ACM Transactions on Database Systems (TODS)
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
A hash-based join algorithm for a cube-connected parallel computer
Information Processing Letters
A parallel algorithm for record clustering
ACM Transactions on Database Systems (TODS)
Highly parallel computing
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
Theory of Relational Databases
Theory of Relational Databases
| Hi-index | 0.00 |
The problem of database normalization in a parallel environment is examined. Generating relation schemes in third normal form is straightforward when given a set of functional dependencies that is a reduced cover. It is shown that a reduced cover for a set offunctional dependencies can be produced in parallel. The correctness of the algorithm is based on two important theorems. it is demonstrated that the companion third normal form algorithm can be easily translated into a parallel version. The performance of the two algorithms is compared to the performance of their serial counterparts. The standard serial algorithms for computing minimal covers and synthesizing third normal form relations are presented. The parallel algorithms and their rationale are discussed.