.png){kind=icon}
返回
Maintaining sliding window skylines on data streams
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2006.48.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The skyline of a multidimensional data set contains the best tuples according to any preference function that is monotonic on each dimension. Although skyline computation has received considerable attention in conventional databases, the existing algorithms are inapplicable to stream applications because 1) they assume static data that are stored in the disk ( rather than continuously arriving/expiring), 2) they focus on one-time execution that returns a single skyline ( in contrast to constantly tracking skyline changes), and 3) they aim at reducing the I/O overhead ( as opposed to minimizing the CPU-cost and main-memory consumption). This paper studies skyline computation in stream environments, where query processing takes into account only a sliding window covering the most recent tuples. We propose algorithms that continuously monitor the incoming data and maintain the skyline incrementally. Our techniques utilize several interesting properties of stream skylines to improve space/time efficiency by expunging data from the system as early as possible (i.e., before their expiration). Furthermore, we analyze the asymptotical performance of the proposed solutions, and evaluate their efficiency with extensive experiments.
Keyword:
skyline
stream
database
algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Wind energy delivery issues [transmission planning and competitive electricity market operation
PREAI
分享收藏分享收藏
查看更多内容