Name
Abstract | ||
|---|---|---|
in general, there can be many reusable intermediate results due to the overlapped windows and periodic execution intervals among Multiple Continuous Queries (MCQ) on data streams. In this regard, we propose an efficient greedy algorithm for a global query plan construction, called GAGPC. GAGPC first decides an execution cycle and finds the maximal Set(s) of Related execution Points (SRP). Next, GAGPC constructs a global execution plan to make MCQ share common join-fragments with the highest benefit in each SRP. The algorithm suggests that the best plan of the same continuous queries may be different according to not only the existence of common expressions, but the size of overlapped windows related to them. It also reflects to reuse not only the whole but partial intermediate results unlike previous work. Finally, we show experimental results for the validation of GAGPC. |
Year | Venue | Keywords |
|---|---|---|
2006 | PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON DATABASES AND APPLICATIONS | Multiple Continuous Queries(MCQ), data streams, Sensor Network, Query Optimization |
Field | DocType | Citations |
Query optimization,Data stream mining,Computer science,Database | Conference | 1 |
PageRank | References | Authors |
0.36 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Young-Kyoon Suh | 1 | 22 | 7.75 |
| Jin Hyun Son | 2 | 217 | 18.21 |
| Myoung Ho Kim | 3 | 1040 | 273.40 |