Idle-Time Processing in Time-Slide Window Join
springer(2016)
摘要
When memory is exhausted from bursty tuple arrivals, some portion of tuples in memory can be evicted to disk, and those tuples can be recalled to complement earlier results when a system becomes idle. This paper presents a method for the idle-time processing when sliding window join queries are given to deal with continuous data streams. Regarding this, we discuss (i) how to determine the priority of tuples for victim selection when memory is not enough and (ii) how to ensure that no result tuple is generated twice when join is conducted with disk-resident tuples in idle time.
更多查看译文
关键词
Window join,Sliding windows,Idle-time processing,Data streams
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要