Optimal distributed execution of join queries

DOI10.1016/0898-1221(94)90094-9zbMath0834.68021OpenAlexW2051476150MaRDI QIDQ1328829

Darryn J. Reid

Publication date: 8 August 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90094-9

zbMATH Keywords

directed graphtree search algorithmdistributed network

Mathematics Subject Classification ID

Integer programming (90C10) Database theory (68P15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Information storage and retrieval of data (68P20)

Related Items (7)

Incorporating processor costs in optimizing the distributed execution of join queries ⋮ 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

• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal distributed execution of join queries