Optimization of distributed tree queries
Journal of Computer and System Sciences
ACM Computing Surveys (CSUR)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
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
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)
Using join operations as reducers in distributed query processing
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
Combinatorial Optimization of Distributed Queries
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Criss-Cross Hash Joins: Design and Analysis
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
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
BioScout: a life-science query monitoring system
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Scalable multi-query optimization for exploratory queries over federated scientific databases
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
Database placement in communication networks for minimizing the overall transmission cost
Mathematical and Computer Modelling: An International Journal
Incorporating processor costs in optimizing the distributed execution of join queries
Mathematical and Computer Modelling: An International Journal
The propagation of updates to relational tables in a distributed database system
Mathematical and Computer Modelling: An International Journal
Allocating relations in a distributed database system
Mathematical and Computer Modelling: An International Journal
Evaluating multiple join queries in a distributed database system
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Executing join queries in an uncertain distributed environment
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
A reduced cover set of the set of full reducer semijoin programs for an acyclic query graph for a distributed database system is given. An algorithm is presented that determines the minimum cost full reducer program. The computational complexity of finding the optimal full reducer for a single relation is of the same order as that of finding the optimal full reducer for all relations. The optimization algorithm is able to handle query graphs where more than one attribute is common between the relations. A method for determining the optimum profitable semijoin program is presented. A low-cost algorithm which determines a near-optimal profitable semijoin program is outlined. This is done by converting a semijoin program into a partial order graph. This graph also allows one to maximize the concurrent processing of the semijoins. It is shown that the minimum response time is given by the largest cost path of the partial order graph. This reducibility is used as a post optimizer for the SSD-1 query optimization algorithm. It is shown that the least upper bound on the length of any profitable semijoin program is N(N-1) for a query graph of N nodes.