Optimal distributed execution of join queries
DOI10.1016/0898-1221(94)90094-9zbMATH Open0834.68021OpenAlexW2051476150MaRDI QIDQ1328829FDOQ1328829
Authors: Darryn J. Reid 
Publication date: 8 August 1994
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(94)90094-9
Recommendations
- scientific article; zbMATH DE number 4049161
- Optimising the distributed execution of join queries in polynomial time
- Incorporating processor costs in optimizing the distributed execution of join queries
- A Global Heuristic For Distributed Join Operations
- Executing join queries in an uncertain distributed environment
- scientific article; zbMATH DE number 970736
Information storage and retrieval of data (68P20) Integer programming (90C10) Database theory (68P15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Desirability of Acyclic Database Schemes
- Title not available (Why is that?)
- A tree-search algorithm for mixed integer programming problems
- Title not available (Why is that?)
- Degrees of acyclicity for hypergraphs and relational database schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network flow, transportation and scheduling. Theory and algorithms
- Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Title not available (Why is that?)
- Using Semi-Joins to Solve Relational Queries
- Title not available (Why is that?)
Cited In (16)
- Allocating relations in a distributed database system
- Optimising the distributed execution of join queries in polynomial time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data
- Evaluating multiple join queries in a distributed database system
- On the optimality of strategies for multiple join
- Incorporating processor costs in optimizing the distributed execution of join queries
- Computational Science – ICCS 2005
- Tie-breaking strategies for fast distance join processing
- A distributed join algorithm
- Executing join queries in an uncertain distributed environment
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
- Taxonomy and formal properties of distributed joins
- The propagation of updates to relational tables in a distributed database system
This page was built for publication: Optimal distributed execution of join queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328829)
