Name
Abstract | ||
|---|---|---|
Traditionally, distributed queries have been optimized centrally and executed synchronously. We outline a frame- work that relaxes both of these constraints using mutant query plans: XML representations of query plans that can also include verbatim XML data, references to resource locations (URLs), or abstract resource names (URNs). Servers work using local, possibly incomplete knowledge, partially evaluate as much of the query plan as they can, incorpo- rate the partial results into a new, mutated query plan and transfer it to some other server that can continue processing. We present preliminary performance results, and discuss issues and strategies for mutant query optimization. |
Year | Venue | Keywords |
|---|---|---|
2002 | WebDB | query optimization,partial evaluation |
Field | DocType | Citations |
Query optimization,Incomplete knowledge,XML,Computer science,Server,Xml data,Distributed algorithm,Database,Query plan | Conference | 10 |
PageRank | References | Authors |
0.67 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vassilis Papadimos | 1 | 405 | 17.65 |
| David Maier | 2 | 5639 | 1666.90 |