Simple Continues Near Neighbor Chain Query with Predestination Data Chain Size

doi:10.3969/j.issn.1000-3428.2012.10.014

Computer Engineering ›› 2012, Vol. 38 ›› Issue (10): 51-53. doi: 10.3969/j.issn.1000-3428.2012.10.014

• Networks and Communications • Previous Articles Next Articles

Simple Continues Near Neighbor Chain Query with Predestination Data Chain Size

ZHANG Li-ping^1a, LI Lin ², LI Song ^1a, HAO Xiao-hong ^1b

(1a. School of Computer Science and Technology; 1b. Computing Center, Harbin University of Science and Technology, Harbin 150080, China; 2. TDLTE System Verification Department, Hangzhou R & D Center, Nokia Siemens Networks Co., Ltd., Hangzhou 310000, China)

Received:2012-02-27 Online:2012-05-20 Published:2012-05-20

预定数据链规模的单纯型连续近邻链查询

张丽平 ^1a，李林 ²，李松 ^1a，郝晓红 ^1b

(1. 哈尔滨理工大学 a. 计算机科学与技术学院；b. 计算中心，哈尔滨 150080；2. 诺基亚西门子通信技术有限公司杭州研发中心TDLTE系统测试部，杭州 310000)

作者简介:张丽平(1976－)，女，讲师、硕士，主研方向：空间数据库技术；李林，工程师、硕士；李松，副教授、博士；郝晓红，高级实验师
基金资助:
国家自然科学基金资助项目(60673136, 60903083)；哈尔滨理工大学青年科学研究基金资助项目(2011)；黑龙江省教育厅科学技术研究基金资助项目(11551084)；黑龙江省自然科学基金资助项目(F200702, F201134)

Abstract

Abstract: This paper researches the Simple Continues Near Neighbor Chain(SCNNC) query with predestination data chain size, based on Hilbert curve, the SCNNC_H_SS algorithm is proposed. The redundant data information can be duly deleted and the number of the effective data point is decreased with operation of the algorithm. The redundant computation is avoided. To maintenance and update the SCNNC, the SCNNC_H_CS algorithm is given. Theatrical analysis and experimental results show that when the scale of data set and the chain are great, the algorithm is superior to the methods based on the tree index structure.

Key words: spatial database, spatial data mining, nearest neighbor query, continues near neighbor chain, R tree, Hilbert curve

摘要： 研究预定数据链规模的单纯型连续近邻链(SCNNC)查询问题，基于Hilbert曲线，提出SCNNC_H_SS算法，将已处理过的数据点从数据集中进行剔除，可减少大量冗余计算。为对SCNNC进行动态维护和更新，提出SCNNC_H_CS算法。理论分析和实验结果表明，在数据集和待查近邻链的规模较大时，相比基于传统树索引结构的方法，该算法具有更高的查询效率。

关键词: 空间数据库, 空间数据挖掘, 最近邻查询, 连续近邻链, R树, Hilbert曲线

CLC Number:

TP391

ZHANG Li-Beng, LI Lin, LI Song, HAO Xiao-Gong. Simple Continues Near Neighbor Chain Query with Predestination Data Chain Size[J]. Computer Engineering, 2012, 38(10): 51-53.

张丽平, 李林, 李松, 郝晓红. 预定数据链规模的单纯型连续近邻链查询[J]. 计算机工程, 2012, 38(10): 51-53.

/ / Recommend / Download Citations

URL: http://www.ecice06.com/EN/10.3969/j.issn.1000-3428.2012.10.014

http://www.ecice06.com/EN/Y2012/V38/I10/51

[1]	WANG Hui, ZHANG Yuhao, SHEN Zihao, LIU Peiqian, CAI Shangqing, LIU Kun. Privacy-Enhanced Multi-Task Allocation Mechanism in Edge Cloud Collaborative Crowdsening [J]. Computer Engineering, 2023, 49(4): 52-60.
[2]	ZHENG Qiumei, XU Linkang, WANG Fenghua, LIN Chao. Pyramid Scene Parsing Network Based on Improved Self-Attention Mechanism [J]. Computer Engineering, 2023, 49(1): 242-249.
[3]	DI Xinkai, YANG Haigang. FPGA-based Accelerator for Sparse Convolutional Neutral Network [J]. Computer Engineering, 2021, 47(7): 189-195,204.
[4]	LI Jiajia,ZANG Yinxu,LIU Xiangyu,XIA Xiufeng,ZHU Rui. Spatial Index Method for Time Dependent Road Network [J]. Computer Engineering, 2019, 45(5): 127-134.
[5]	WANG Xiaoxuan,WANG Jun,JIA Yingying,ZHANG Xin. Survey of Network Topology Recovery Algorithms in Wireless Sensor Network [J]. Computer Engineering, 2018, 44(8): 93-99.
[6]	YANG Xiujuan,DONG Jun,LI Huihui,YUAN Yanzhong,CHEN Xiaodan. Reverse Furthest Neighbor Query Method Based on Improved Metric Index [J]. Computer Engineering, 2017, 43(4): 234-238.
[7]	LI Song,ZHANG Li-ping,LIU Yan,HAO Xiao-hong,YANG He-yu. Dynamic Simple Continues Near Neighbor Chain Query with Obstacles [J]. Computer Engineering, 2014, 40(8): 52-57.
[8]	HAO Xiao-hong, ZHANG Li-ping, ZHAO Ling-qiang, LI Song. 3DR39-3d Orientation Relation Model and Reverse Orientation Relation [J]. Computer Engineering, 2014, 40(7): 258-262.
[9]	GAO Jun, HAO Zhong-xiao. Nearest Neighbor Query for Fuzzy Object in Constraint Network [J]. Computer Engineering, 2014, 40(3): 39-45.
[10]	YANG Ze-xue, HAO Zhong-xiao. Continuous Reverse Nearest Neighbor Search Based on Voronoi Diagram [J]. Computer Engineering, 2014, 40(1): 272-274,279.
[11]	ZHANG An-Bin, YUE Yun-Tian, ZHANG Chuan-Fu. Adaptive Steganography Algorithm of Rapid Wet Paper Code Based on Hilbert [J]. Computer Engineering, 2013, 39(7): 161-164.
[12]	ZHANG Li-Beng, LI Song, LI Lin, HAO Xiao-Gong. Research on Dynamic Direction Relation and Reverse Relation of 3DR44 Model [J]. Computer Engineering, 2013, 39(5): 65-68.
[13]	HAO Xiao-Gong, LI Song, ZHANG Li-Beng. Representation Model of 3DR44-4d Orientation Relation [J]. Computer Engineering, 2012, 38(3): 57-59.
[14]	FENG Yan-Peng, WU Bo, ZHENG Gong-Yan, MENG Xian-Jun. Target Tracking Online Node Schedule Algorithm in Wireless Sensor Network [J]. Computer Engineering, 2012, 38(11): 96-99,103.
[15]	FANG Gang. Frequent Neighboring Class Set Mining Algorithm Depending on Constraint Power Set [J]. Computer Engineering, 2012, 38(11): 62-65.

Please choose a citation manager

Content to export

Simple Continues Near Neighbor Chain Query with Predestination Data Chain Size

预定数据链规模的单纯型连续近邻链查询

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments

模态框（Modal）标题

Please choose a citation manager

Content to export

Simple Continues Near Neighbor Chain Query with Predestination Data Chain Size

预定数据链规模的单纯型连续近邻链查询

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments