Incorporating processor costs in optimizing the distributed execution of join queries
From MaRDI portal
Publication:1336868
DOI10.1016/0895-7177(94)90029-9zbMath0810.90037OpenAlexW2070016148MaRDI QIDQ1336868
Publication date: 6 November 1994
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(94)90029-9
Applications of mathematical programming (90C90) Integer programming (90C10) Database theory (68P15) Communication networks in operations research (90B18)
Related Items (6)
Executing join queries in an uncertain distributed environment ⋮ Allocating relations in a distributed database system ⋮ Minimizing the response time of executing a join between fragmented relations in a distributed database system ⋮ The propagation of updates to relational tables in a distributed database system ⋮ Optimising the distributed execution of join queries in polynomial time ⋮ Evaluating multiple join queries in a distributed database system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The art and theory of dynamic programming
- Optimal distributed execution of join queries
- Network flow, transportation and scheduling. Theory and algorithms
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Using Semi-Joins to Solve Relational Queries
- A tree-search algorithm for mixed integer programming problems
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Generalized dynamic programming methods in integer programming
This page was built for publication: Incorporating processor costs in optimizing the distributed execution of join queries