An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
A Heuristic Approach to Distributed Query Processing
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Set query optimization in distributed database systems
ACM Transactions on Database Systems (TODS)
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Algorithms for Multidimensional Partitioning of Static Files
IEEE Transactions on Software Engineering
Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network
IEEE Transactions on Software Engineering
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
Optimizing equijoin queries in distributed databases where relations are hash partitioned
ACM Transactions on Database Systems (TODS)
Join processing in relational databases
ACM Computing Surveys (CSUR)
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
An Intelligent Search Method for Query Optimization by Semijoins
IEEE Transactions on Knowledge and Data Engineering
An Object-Oriented Query Evaluation Scheme for Logical Databases in Massively Parallel Environment
IEEE Transactions on Knowledge and Data Engineering
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Efficiently ordering subgoals with access constraints
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A systematic approach to the integration of overlapping partitions in service-oriented data grids
Future Generation Computer Systems
| Hi-index | 0.00 |
This paper analyzes the problem of joining two horizontally partitioned relations in a distributed database system. Two types of semijoin strategies are introduced, local and remote. Local semijoins are performed at the site of the restricted relation (or fragment), and remote semijoins can be performed at an arbitrary site. A mathematical model of a semijoin strategy for the case of remote semijoins is developed, and lower bounding and heuristic procedures are proposed. The results of computational experiments are reported. The experiments include an analysis of the heuristics' performance relative to the lower bounds, sensitivity analysis, and error analysis. These results reveal a good performance of the heuristic procedures, and demonstrate the benefit of using semijoin operations to reduce the size of fragments prior to their transmission. The algorithms for the case of remote semijoins were found to be superior to the algorithms for the case of local semijoins. In addition, we found that the estimation accuracy of the selectivity factors has a significant effect on the incurred communication cost.