Research on Optimization of Top-k algorithm for continuous query of spatial objects in road network

被引:0
作者
Wang, Zhen [1 ]
机构
[1] Liaodong Univ, Inst Informat Technol, Dandong, Liaoning, Peoples R China
来源
PROCEEDINGS OF THE 2ND INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC 2016) | 2016年 / 24卷
关键词
Road network; Top-k; Spatial data query; STM; LBS;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In the network environment, the query efficiency of spatial object Top-k query algorithm is an important index to measure the performance of the query. Because in the practical application of query location is often mobile, using the traditional snapshot query to deal with the efficiency of mobile query point Top-k query is poor. The server often receive a large number of query requests, the traditional query algorithm to deal with this situation is also relatively low efficiency. Due to the above reasons, this paper based on the traditional snapshot query method based on Top-k spatial data based on continuous query method is improved, in the algorithm used bottom snapshot query algorithm to solve the problem of space on a single keyword query, use the expansion tree T to traverse the network edge. Finally, through experiments in real road network data set.Finally, through experiments in real road network data set, the efficiency of the proposed algorithm is verified under different parameter conditions.
引用
收藏
页码:377 / 380
页数:4
相关论文
共 50 条
[21]   A Filter-Based Uniform Algorithm for Optimizing Top-k Query in Distributed Networks [J].
ZHAO Zhibin YAO Lan YANG Xiaochun LI Binyang YU Ge College of Information Science and Engineering Northeastern University Shenyang Liaoning China .
Wuhan University Journal of Natural Sciences, 2006, (05) :1383-1388
[22]   The Top-k Skyline Query in Pervasive Computing Environments [J].
Pan, Peng ;
Sun, YuQing ;
Li, Qingzhong ;
Chen, ZhiYong ;
Bian, Ji .
JCPC: 2009 JOINT CONFERENCE ON PERVASIVE COMPUTING, 2009, :335-338
[23]   KSQ: Top-k Similarity Query on Uncertain Trajectories [J].
Ma, Chunyang ;
Lu, Hua ;
Shou, Lidan ;
Chen, Gang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (09) :2049-2062
[24]   Top-k critical Vertices Query on Shortest Path [J].
Ma, Jing ;
Yao, Bin ;
Gao, Xiaofeng ;
Shen, Yanyan ;
Guo, Minyi .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (10) :1999-2012
[25]   Top-K Similarity Search for Query-By-Humming [J].
Wang, Peipei ;
Wang, Bin ;
Luo, Shiying .
Web-Age Information Management, Pt II, 2016, 9659 :198-210
[26]   Top-K Frequent Spatial-Temporal Words Query Based on R-Tree [J].
Yu, Shoujian ;
Cai, Guohui ;
Li, Weimin ;
Xie, Jianyun .
2018 16TH IEEE INT CONF ON DEPENDABLE, AUTONOM AND SECURE COMP, 16TH IEEE INT CONF ON PERVAS INTELLIGENCE AND COMP, 4TH IEEE INT CONF ON BIG DATA INTELLIGENCE AND COMP, 3RD IEEE CYBER SCI AND TECHNOL CONGRESS (DASC/PICOM/DATACOM/CYBERSCITECH), 2018, :423-428
[27]   A General Technique for Top-k Geometric Intersection Query Problems [J].
Rahul, Saladi ;
Janardan, Ravi .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (12) :2859-2871
[28]   Top-k shortest-path query on RDF graphs [J].
Zhang, Deng-Yi ;
Wu, Wen-Li ;
Ouyang, Chu-Fei .
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2015, 43 (08) :1531-1537
[29]   Reverse spatial top-k keyword queries [J].
Ahmed, Pritom ;
Eldawy, Ahmed ;
Hristidis, Vagelis ;
Tsotras, Vassilis J. .
VLDB JOURNAL, 2023, 32 (03) :501-524
[30]   Top-K Collective Spatial Keyword Queries [J].
Su, Danni ;
Zhou, Xu ;
Yang, Zhibang ;
Zeng, Yifu ;
Gao, Yunjun .
IEEE ACCESS, 2019, 7 :180779-180792