Minimizing the response time of executing a join between fragmented relations in a distributed database system
From MaRDI portal
Publication:1362219
DOI10.1016/S0895-7177(96)00185-9zbMATH Open0879.68032OpenAlexW2030860481MaRDI QIDQ1362219FDOQ1362219
Authors: Darryn J. Reid
Publication date: 3 August 1997
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(96)00185-9
Recommendations
Cites Work
- 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?)
- The art and theory of dynamic programming
- 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
- Tree queries
- Title not available (Why is that?)
- Using Semi-Joins to Solve Relational Queries
- Correctness of query execution strategies in distributed databases
- Allocating relations in a distributed database system
- Optimal distributed execution of join queries
- Equivalence and optimization of relational transactions
- Title not available (Why is that?)
- Evaluating multiple join queries in a distributed database system
- Incorporating processor costs in optimizing the distributed execution of join queries
- Executing join queries in an uncertain distributed environment
- Title not available (Why is that?)
- The propagation of updates to relational tables in a distributed database system
Cited In (4)
This page was built for publication: Minimizing the response time of executing a join between fragmented relations in a distributed database system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362219)