Name
Abstract | ||
|---|---|---|
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environment. Each query is a conjunction of boolean filters, and each filter could be shared across multiple queries. We are required to design an evaluation plan that evaluates filters against stream items in order to determine the set of queries satisfied by each item. The evaluation plan specifies for each item: (i) the subset of filters evaluated for this item and the order of their evaluations, and (ii) the processor on which each filter evaluation occurs. Our goal is to design an evaluation plan which maximizes the total throughput (flow) of the stream handled by the plan, without violating the processor capacities. Filter ordering has received extensive attention in single-processor settings, with the objective of minimizing the total cost of filter evaluations: in particular, efficient (approximation) algorithms are known for various important versions of min-cost filter ordering. Min-cost filter ordering problem for a single processor is a special case of our flow maximization for parallel processors. Our main contribution in this work is a generic flow-maximization algorithm, which assumes the availability of a min-cost filter ordering algorithm for a single processor, and uses this to iteratively construct a solution to the flow-maximization problem for heterogenous parallel processors. We show that the approximation ratio of our flow-maximization strategy is essentially the same as that of the underlying min-cost filter ordering algorithm. Our result, along with existing results on min-cost filter ordering, enables the optimization of several important versions of filter ordering in parallel environments. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1376916.1376929 | PODS |
Keywords | Field | DocType |
underlying min-cost filter,boolean filter,parallel environment,filter evaluation,evaluation plan,min-cost filter,heterogenous parallel processor,heterogenous parallel environment,single processor,shared filter,generic flow algorithm,parallel processor,query optimization,parallel,satisfiability | Query optimization,Mathematical optimization,Data stream,Computer science,Flow (psychology),Algorithm,Theoretical computer science,Kernel adaptive filter,Adaptive filter,Throughput,Maximization,Special case | Conference |
Citations | PageRank | References |
8 | 0.73 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen Liu | 1 | 1088 | 102.40 |
| Srinivasan Parthasarathy | 2 | 131 | 5.40 |
| Anand Ranganathan | 3 | 2696 | 164.67 |
| Hao Yang | 4 | 660 | 48.26 |