12 0

GAGPC: Optimization of Multiple Continuous Queries on Data

Title
GAGPC: Optimization of Multiple Continuous Queries on Data
Author
손진현
Issue Date
2006-02
Publisher
ACM
Citation
Proceeding DBA'06 Proceedings of the 24th IASTED international conference on Database and applications, Page. 215-220
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.
URI
https://dl.acm.org/citation.cfm?id=1167025http://repository.hanyang.ac.kr/handle/20.500.11754/107696
ISBN
0-88986-560-4
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > ETC
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE