Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Decompositions and functional dependencies in relations
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
The tree property is fundamental for query processing
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A file organization suitable for relational database operations
Proceedings of the International Conference on Mathematical Studies of Information Processing
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
The equivalence of solving queries and producing tree projections (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query optimization in a memory-resident domain relational calculus database system
ACM Transactions on Database Systems (TODS)
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
The implication problem for inclusion dependencies: a graph approach
ACM SIGMOD Record
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Processing Inequality Queries Based on Generalized Semi-Joins
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
On Inferences ofWeak Multivalued Dependencies
Fundamenta Informaticae
Generating query plans for distributed query processing using genetic algorithm
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Allocating relations in a distributed database system
Mathematical and Computer Modelling: An International Journal
On Inferences ofWeak Multivalued Dependencies
Fundamenta Informaticae
An efficient approach to identify n-wMVD for eliminating data redundancy
Proceedings of the CUBE International Information Technology Conference
| Hi-index | 0.00 |
Since join operations are expensive, usually join scheduling is very important for query processing. In this paper we will discuss new procedures to handle cyclic queries utilizing dependencies and horizontal decompositions. There are three known procedures for cyclic query processing: (1) Relation merging, (2) Tuple-wise processing, (3) Attribute addition. As join operations are applied to relations which are processed by selection operations, the number of tuples is usually less than the original relation and thus there are situations in which temporary FDs are satisfied. Such FDs can be used to simplify the given query. To convert a given cyclic query into a tree, some relations must satisfy a set of FDs. This can be attained by horizontal decomposition. Tuple-wise processing and attribute addition are shown to be special cases of the FD-based procedure. We have also developed MVD-based procedures which are generalized from the FD-based procedure.