吉林大学学报(工学版) ›› 2014, Vol. 44 ›› Issue (6): 1799-1805.doi: 10.13229/j.cnki.jdxbgxb201406040
冯钧1, 史涯晴1, 2, 唐志贤1, 芮彩华1
FENG Jun1, SHI Ya-qing1, 2, TANG Zhi-xian1, RUI Cai-hua1
摘要: 结合能够解决重复计数问题的Sketch技术和能够以较小存储空间获得高效近似聚集查询结果的AMH+技术,借鉴aCN-RB-tree支持方向属性聚集的特性,提出了DSD+动态草图索引结构,解决了路网环境下移动对象的聚集查询问题。性能分析和试验结果表明:与现有的索引结构相比,DSD+在保证查询时间和查询误差优势的基础上显著减少了存储空间。
中图分类号:
[1] Papadias D, Tao Y F, Kalnis P, et al. Indexing spatio-temporal data warehouses[C]∥Proceedings of International Conference on Data Engineering. San Jose CA, USA, 2002: 166-175. [2] Tao Y F, Kollios G, Considine J, et al. Spatio-temporal aggregation using sketches[C]∥Proceedings of International Conference of Data Engineering, Boston, USA,2004: 214-226. [3] Odysseas P, Minos G, Antonios D. Sketch-based querying of distributed sliding-window data streams[C]∥Proceedings of the VLDB Endowment,Istanbul, Turkey, 2012: 992-1003. [4] Sun J M, Papadias D, Tao Y F, et al. Querying about the past,the present, and the future in spatio-temporal[C]∥Proceedings of International Conference of Data Engineering, Boston, USA,2004:202-213. [5] Feng Jun, Lu Ja-min, Lu Yang, et al. RR-tree: an efficient structure for managing road networks[C]∥Proceedings of the 16th International Conference on Applications of Declarative Programming and Knowledge Management, Japan, 2005:107-116. [6] Feng Jun, Lu Chun-yan, Wang Ying, et al. Sketch RR-tree:a spatio-temporal aggregation index for network-constrained moving objects[C]∥Proceedings of International Conference on Innovative Computing, Information and Control, Dalian,China,2008:4-7. [7] Jin Che-qing, Guo Wei-bin, Zhao Fu-tong. Getting qualified answers for aggregate queries in spatio-temporal databases[J]. Lecture Notes in Computer Science,2007,4505:220-227. [8] Feng Jun, Zhu Zhong-hua. Modified histogram: a spatio-temporal aggregate index for moving objects in road networks[J]. Procedia Engineering, 2012,29:4135-4139. [9] Frentzos E. Indexing objects moving on fixed networks[C]∥Proc 8th International Symposium on Spatial and Temporal Databases, Santorini Island, Greece, 2003:289-305. [10] Nguyen T, He Z, Zhang R, et al. Boosting moving object indexing through velocity partitioning[C]∥Proceedings of the VLDB Endowment, Istanbul, Turkey,2012:860-871. [11] Lee D W, Baek S H, Bae H Y. aCN-RB-tree: update method for spatio temporal aggregation of moveing object trajectory in ubiquitous environment[C]∥International Conference on Computational Science and Its Application, Korea, 2009:177-182. [12] Philippe F, Nigel M G. Probabilistic counting algorithms for data base applications[J]. JCSS, 1985,32(2):182-209. [13] Ding Xiao-feng, Lian Xiang,Chen Lei, et al. Continuous monitoring of skylines over uncertain data streams[J]. Information Science, 2012,184(1):196-214. |
[1] | 刘富,宗宇轩,康冰,张益萌,林彩霞,赵宏伟. 基于优化纹理特征的手背静脉识别系统[J]. 吉林大学学报(工学版), 2018, 48(6): 1844-1850. |
[2] | 王利民,刘洋,孙铭会,李美慧. 基于Markov blanket的无约束型K阶贝叶斯集成分类模型[J]. 吉林大学学报(工学版), 2018, 48(6): 1851-1858. |
[3] | 金顺福,王宝帅,郝闪闪,贾晓光,霍占强. 基于备用虚拟机同步休眠的云数据中心节能策略及性能[J]. 吉林大学学报(工学版), 2018, 48(6): 1859-1866. |
[4] | 赵东,孙明玉,朱金龙,于繁华,刘光洁,陈慧灵. 结合粒子群和单纯形的改进飞蛾优化算法[J]. 吉林大学学报(工学版), 2018, 48(6): 1867-1872. |
[5] | 刘恩泽,吴文福. 基于机器视觉的农作物表面多特征决策融合病变判断算法[J]. 吉林大学学报(工学版), 2018, 48(6): 1873-1878. |
[6] | 欧阳丹彤, 范琪. 子句级别语境感知的开放信息抽取方法[J]. 吉林大学学报(工学版), 2018, 48(5): 1563-1570. |
[7] | 刘富, 兰旭腾, 侯涛, 康冰, 刘云, 林彩霞. 基于优化k-mer频率的宏基因组聚类方法[J]. 吉林大学学报(工学版), 2018, 48(5): 1593-1599. |
[8] | 桂春, 黄旺星. 基于改进的标签传播算法的网络聚类方法[J]. 吉林大学学报(工学版), 2018, 48(5): 1600-1605. |
[9] | 刘元宁, 刘帅, 朱晓冬, 陈一浩, 郑少阁, 沈椿壮. 基于高斯拉普拉斯算子与自适应优化伽柏滤波的虹膜识别[J]. 吉林大学学报(工学版), 2018, 48(5): 1606-1613. |
[10] | 车翔玖, 王利, 郭晓新. 基于多尺度特征融合的边界检测算法[J]. 吉林大学学报(工学版), 2018, 48(5): 1621-1628. |
[11] | 赵宏伟, 刘宇琦, 董立岩, 王玉, 刘陪. 智能交通混合动态路径优化算法[J]. 吉林大学学报(工学版), 2018, 48(4): 1214-1223. |
[12] | 黄辉, 冯西安, 魏燕, 许驰, 陈慧灵. 基于增强核极限学习机的专业选择智能系统[J]. 吉林大学学报(工学版), 2018, 48(4): 1224-1230. |
[13] | 傅文博, 张杰, 陈永乐. 物联网环境下抵抗路由欺骗攻击的网络拓扑发现算法[J]. 吉林大学学报(工学版), 2018, 48(4): 1231-1236. |
[14] | 曹洁, 苏哲, 李晓旭. 基于Corr-LDA模型的图像标注方法[J]. 吉林大学学报(工学版), 2018, 48(4): 1237-1243. |
[15] | 侯永宏, 王利伟, 邢家明. 基于HTTP的动态自适应流媒体传输算法[J]. 吉林大学学报(工学版), 2018, 48(4): 1244-1253. |
|