Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Asserting the optimality of serial SJRPs in processing simple queries in chain networks
Information Processing Letters
ACM Computing Surveys (CSUR)
A state transition model for distributed query processing
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
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
Practical selectivity estimation through adaptive sampling
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Principles of distributed database systems
Principles of distributed database systems
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)
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Query optimization in distributed database systems and multidatabase systems
Query optimization in distributed database systems and multidatabase systems
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A methodology for interpreting tree queries into optimal semi-join expressions
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program
IEEE Transactions on Knowledge and Data Engineering
A Parallel Execution Method for Minimizing Distributed Query Response Time
IEEE Transactions on Parallel and Distributed Systems
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
A Taxonomy and Performance Model of Data Skew Effects in Parallel Joins
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Heuristic Approach to Distributed Query Processing
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Distributed join processing using bipartite graphs
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Distributed query processing algorithms usually performdata reduction by using a semijoin program, but the problem withthese approaches is that they still require an explicit join of thereduced relations in the final phase. We introduce an efficientalgorithm for join processing in distributed database systems thatmakes use of bipartite graphs in order to reduce data communicationcosts and local processing costs. The bipartite graphs represent thetuples that can be joined in two relations taking also into accountthe reduction state of the relations. This algorithm fully reducesthe relations at each site. We then present an adaptive algorithm forresponse time optimization that takes into account the systemconfiguration, i.e., the additional resources available and the datacharacteristics, in order to select the best strategy for responsetime minimization. We also report on the results of a set ofexperiments which show that our algorithms outperform a number of therecently proposed methods for total processing time and response timeminimization.