Optimising the distributed execution of join queries in polynomial time

DOI10.1016/S0898-1221(99)00051-6zbMath0946.68036OpenAlexW1986636039MaRDI QIDQ1962961

Darryn J. Reid

Publication date: 20 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00051-6

zbMATH Keywords

distributed database system

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Database theory (68P15)

Cites Work

• 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
• Minimizing the response time of executing a join between fragmented relations in a distributed database system
• Evaluating multiple join queries in a distributed database system
• 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
• Degrees of acyclicity for hypergraphs and relational database schemes
• Equivalence and optimization of relational transactions
• Using Semi-Joins to Solve Relational Queries
• Tree queries
• Query Processing in Distributed Database System
• A relational model of data for large shared data banks
• Generalized dynamic programming methods in integer programming

This page was built for publication: Optimising the distributed execution of join queries in polynomial time