Minimizing the response time of executing a join between fragmented relations in a distributed database system

DOI10.1016/S0895-7177(96)00185-9zbMath0879.68032OpenAlexW2030860481MaRDI QIDQ1362219

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

zbMATH Keywords

database managementjoin query performance

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Optimising the distributed execution of join queries in polynomial time

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
• Incorporating processor costs in optimizing the distributed execution of join queries
• Evaluating multiple join queries in a distributed database system
• Network flow, transportation and scheduling. Theory and algorithms
• Executing join queries in an uncertain distributed environment
• Allocating relations in a distributed database system
• The propagation of updates to relational tables in a distributed database system
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Correctness of query execution strategies in distributed databases
• Equivalence and optimization of relational transactions
• Using Semi-Joins to Solve Relational Queries
• Tree queries