Computer Science ›› 2014, Vol. 41 ›› Issue (7): 232-235.doi: 10.11896/j.issn.1002-137X.2014.07.048

Previous Articles     Next Articles

Research on Processing Continuous Spatial Keyword Range Queries in Road Networks

LI Yan-hong,HUANG Qun,JIANG Hong and LI Guo-hui   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Compared with traditional location-based queries,spatial keyword queries can better meet the requirement of actual query processing.The paper addressed the issue of processing spatial keyword queries which consider both the distance and the keyword similarity of objects,and presented an efficient method to deal with continuous spatial keyword range queries in road networks(CRSKQ).A network model which considers the road segments,the objects,and the connectivity of the road network was proposed to support CRSKQ query processing.In order to continuously monitor the query result,a method which includes two phases,the initial query result getting phase and the continuous monitoring phase,was proposed.In the first phase,the initial query result objects can be found by road network expansion and keyword matching.In the second phase,the cost of continuous query monitoring can be greatly reduced by taking advantage of the query result of the previous time.Finally,experimental result shows the efficiency of our method.

Key words: Location-based query,Continuous spatial keyword range query,Road network,Algorithm

[1] Papadias D,Zhang Jun,Mamoulis N,et al.Query processing in spatial network databases[C]∥Proc of VLDB.Gerlin:Morgan Kaufmann,2003:802-813
[2] Kolahdouzan M,Shahabi C.Voronoi-based k-nearest neighborsearch for spatial network databases[C]∥Proc of VLDB.Toronto:Morgan Kaufmann,2004:840-851
[3] Mouratidis K,Yiu Manlung,Papadias D.et al.Continuous nearest neighbor monitoring in road networks[C]∥Proc of VLDB.Seoul:ACM Press,2006:43-54
[4] Huang Yuan-ko,Chen Zhi-wei,Lee Chiang.Continuous K-Nearest neighbor query over moving objects in road network[C]∥Proc of APWeb-WAIM.Suzhou:Springer,2009:27-38
[5] Zheng Bai-hua,Xu Jian-liang,Lee Wang-chien,et al.Grid-partition index:a hybrid method for nearest-neighbor queries in wireless location-based services[J].The International Journal on Very Large Data Bases,2006,15(1):21-39
[6] Zhou Y,Xie X,Wang C,et al.Hybrid index structures for loca-tion-based web search [C]∥Proc of ACM CIKM.Bremen:ACM Press,2005:155-162
[7] Ed Felipe I,Hristidis V,Rishe N.Keyword search on spatial da-tabases [C]∥Proc of ICDE.Cancun:IEEE,2008:656-665
[8] Wu D,Yiu M L,Jensen C S,et al.Efficient continuously moving top-k spatial keyword query processing [C]∥Proc of ICDE.Hannover:IEEE,2011:541-551
[9] Lu J,Lu Y,Cong G.Reverse spatial and textual k nearest neighbor search[C]∥Proc of SIGMOD.Athens:ACM Press,2011:349-360
[10] Li G,Feng J,Xu J.DESKS:Direction-Aware Spatial KeywordSearch[C]∥Proc of ICDE.Washington DC:IEEE,2012:474-485
[11] Wu D M,Yiu M L,Cong G,et al.Joint Top-k Spatial Keyword Query Processing [J].IEEE Transaction on KDE,2012,24(10):1889-1903
[12] Guttman A.R-Tree:A Dynamic Index Structure for SpatialSearching[C]∥Proc of ACM-SIGMOD International Confe-rence on Management of Data.San Jose:ACM Press,1995:47-57

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!