Evaluating multiple join queries in a distributed database system
From MaRDI portal
Publication:1804921
DOI10.1016/0895-7177(95)00033-XzbMath0821.90139OpenAlexW2053676785MaRDI QIDQ1804921
Publication date: 4 May 1995
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(95)00033-x
Applications of mathematical programming (90C90) Integer programming (90C10) Database theory (68P15) Linear programming (90C05)
Related Items (5)
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
Cites Work
- Optimal distributed execution of join queries
- Incorporating processor costs in optimizing the distributed execution of join queries
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Evaluating multiple join queries in a distributed database system