Storage optimization for query processing over data streams |
| |
| Authors: | TANG Xiang-hong LI Guo-hui CHEN Gang and DU Xiao-kun |
| |
| Institution: | School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,P.R.China |
| |
| Abstract: | A defining characteristic of continuous queries over on-line data streams,possibly bounded by sliding windows,is the potentially infinite and time-evolving nature of their inputs and outputs.For different update patterns of continuous queries,suitable data structures bring great query processing efficiency.In this paper,we proposed a data structure suitable for weak nonmonotonic update pattern in which the lifetime of each tuple is known at generation time,but the length of lifetime is not necessarily the same.The new data structure combined the ladder queue with the feature of weak non-monotonic update pattern.The experiment results show that the new data structure performs much better than the traditional calendar queue in many cases. |
| |
| Keywords: | calendar queue ladder queue query processing sliding windows |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(英文版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(英文版)》下载免费的PDF全文 |
