Allocating relations in a distributed database system
From MaRDI portal
Publication:1903394
DOI10.1016/0895-7177(95)00153-SzbMath0835.68033MaRDI QIDQ1903394
Maria E. Orlowska, Darryn J. Reid
Publication date: 16 April 1996
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items
Minimizing the response time of executing a join between fragmented relations in a distributed database system, Optimising the distributed execution of join queries in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear integer programming algorithms: A survey
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Optimal distributed execution of join queries
- Incorporating processor costs in optimizing the distributed execution of join queries
- Evaluating multiple join queries in a distributed database system
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- A Nested Dual Ascent Procedure For The Dynamic Single File Allocation Problem
- Using Semi-Joins to Solve Relational Queries
- Branch-and-Bound Methods: A Survey
- A tree-search algorithm for mixed integer programming problems
- Optimal File Allocation in a Multiple Computer System
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
