Dynamically Distributed Query Evaluation Trevor Jim and Dan Suciu   View Paper (PDF)   Return to Querying Web Data Abstract Distributed query evaluation usually assumes a fixed topology, where the set of servers and the partitioning of data on the servers is known in advance. Given a query expression, an optimizer will first produce a global plan, then assign a server for each operator in the plan. The query is then evaluated distributively, according to that plan. DiSC'02 © 2003 Association for Computing Machinery