计算机工程2011，Vol.37Issue(16)：17-20,4.DOI:10.3969/j.issn.1000-3428.2011.16.006
面向轨迹数据流的KNN近似查询
KNN Approximate Query for Trajectory Data Stream
摘要
Abstract
This paper proposes a novel approach for continuous approximate query over trajectory stream based on sliding window. Through local clustering, the sliding window is divide into various sized basic windows and sampling the data elements of a basic window using biased sampling rate, forms trajectory stream synopses. Toward such synopses, it can implement distributed K-Nearest Neighbor(KNN) queries utilizing the plane sweep algorithm of computational geometry. The extensive experiments verify the effectiveness of proposed algorithm and it has better expansibility.关键词
轨迹数据流/局部聚类/偏倚采样/数据摘要/K-最近邻查询Key words
trajectory data stream/local clustering/biased sampling/data synopses/K-Nearest Neighbor(KNN) query分类
信息技术与安全科学引用本文复制引用
王考杰,郑雪峰,宋一丁,曲阜平..面向轨迹数据流的KNN近似查询[J].计算机工程,2011,37(16):17-20,4.基金项目
国家科技支撑计划基金资助重点项目(2006BAG01A07) （2006BAG01A07）
