摘要: 在给出多因素时间序列Skyline(MFTS)形式化定义的基础上,提出一种MFTS快速查询算法,获得并存储各时间点上的多因素值,计算每个最小时间区间的准MFTS,从而得到指定区间的MFTS。实验分析结果表明,在时间序列重合较少的情况下,该算法具有较好的查询效率。
关键词:
多因素时间序列Skyline,
MFTS快速查询,
Skyline查询,
算法复杂度
Abstract: This paper proposes a Multi Factor Timed Skyline(MFTS) skyline fast query algorithm with MFTS. The algorithm gets and stores the multi-factor in each time point, computes expectant MFTS in each minimum time interval. The algorithm computes the MFTS in the designated time interval. Experimental analysis shows that this algorithm has better effective under the circumstance of less coincident time series.
Key words:
Multi Factor Timed Skyline(MFTS),
MFTS fast query,
Skyline query,
algorithm complexity
中图分类号:
金鑫. 多因素时间序列Skyline的快速查询算法[J]. 计算机工程, 2011, 37(9): 84-86.
JIN Xin. Fast Query Algorithm of Multi Factor Timed Skyline[J]. Computer Engineering, 2011, 37(9): 84-86.