Keeping an eye on moving objects: processing continuous spatial-keyword range queries

被引:2
作者
Orabi, Mariam [1 ]
Al Aghbari, Zaher [1 ]
Kamel, Ibrahim [1 ]
Mouheb, Djedjiga [1 ]
机构
[1] Univ Sharjah, Coll Comp & Informat, Univ City Rd, Sharjah, U Arab Emirates
关键词
Moving objects; Spatial-textual objects; Continuous query; Spatial-keyword query; Cloud-based computing; In-memory index; PUBLISH/SUBSCRIBE; NETWORK;
D O I
10.1007/s10707-023-00499-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the emergence of GPS-equipped portable devices and Online Social Networks, geo-tagged textual data have been highly produced on a continuous basis, which can provide important information for various applications, such as marketing, disaster response, and so on. Therefore, processing continuous spatial-keyword queries over streaming data is a hot topic for the research community nowadays. However, applying such queries to moving objects is computationally expensive due to the frequent updates of objects' information that will continuously change the queries' answers. Few research works focus on processing spatial-keyword queries over moving objects, so this problem demands more exploration by research. This paper proposes Lagic; a cloud-based solution scheme to process continuous spatial-keyword range queries over moving objects. Lagic is the first model that provides an exact solution to the problem and minimizes the overhead on users' devices. A parallelized in-memory indexing structure is proposed to ensure the efficiency and scalability of Lagic. Short-term Safe Regions and a new approach for Buffer Regions are presented to reduce the number of required computations to update queries' answer sets in an incremental manner. Evaluations show that Lagic can reduce the total processing time to seven folds less than a baseline model. It also provides better computational scalability and efficiency. Furthermore, Lagic shows stability in continuous running time against variations of queries' and objects' attributes.
引用
收藏
页码:117 / 143
页数:27
相关论文
共 49 条
[31]   Uncertain Distance-Based Range Queries over Uncertain Moving Objects [J].
Chen, Yi-Fei ;
Qin, Xiao-Lin ;
Liu, Liang .
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2010, 25 (05) :982-998
[32]   A highly optimized algorithm for continuous intersection join queries over moving objects [J].
Rui Zhang ;
Jianzhong Qi ;
Dan Lin ;
Wei Wang ;
Raymond Chi-Wing Wong .
The VLDB Journal, 2012, 21 :561-586
[33]   A highly optimized algorithm for continuous intersection join queries over moving objects [J].
Zhang, Rui ;
Qi, Jianzhong ;
Lin, Dan ;
Wang, Wei ;
Wong, Raymond Chi-Wing .
VLDB JOURNAL, 2012, 21 (04) :561-586
[34]   Real-Time Spatial Queries for Moving Objects Using Storm Topology [J].
Zhang, Feng ;
Zheng, Ye ;
Xu, Dengping ;
Du, Zhenhong ;
Wang, Yingzhi ;
Liu, Renyi ;
Ye, Xinyue .
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2016, 5 (10)
[35]   Scalable Distributed Processing of K Nearest Neighbor Queries over Moving Objects [J].
Yu, Ziqiang ;
Liu, Yang ;
Yu, Xiaohui ;
Pu, Ken Q. .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (05) :1383-1396
[36]   Range and kNN Query Processing for Moving Objects in Grid Model [J].
Hae Don Chon ;
Divyakant Agrawal ;
Amr El Abbadi .
Mobile Networks and Applications, 2003, 8 :401-412
[37]   Range and kNN query processing for moving objects in grid model [J].
Chon, HD ;
Agrawal, D ;
El Abbadi, A .
MOBILE NETWORKS & APPLICATIONS, 2003, 8 (04) :401-412
[38]   A Line Graph-Based Continuous Range Query Method for Moving Objects in Networks [J].
Zhang, Hengcai ;
Lu, Feng ;
Chen, Jie .
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2016, 5 (12)
[39]   Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity [J].
Yuan-Ko Huang ;
Chiang Lee .
GeoInformatica, 2010, 14 :163-200
[40]   Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects [J].
Prabhakar, S ;
Xia, YN ;
Kalashnikov, DV ;
Aref, WG ;
Hambrusch, SE .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (10) :1124-1140