{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:05:23Z","timestamp":1769166323489,"version":"3.49.0"},"reference-count":118,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council (ARC) Future Fellowships","award":["FT120100832"],"award-info":[{"award-number":["FT120100832"]}]},{"DOI":"10.13039\/501100007290","name":"Obel Family Foundation","doi-asserted-by":"crossref","award":["FT120100832"],"award-info":[{"award-number":["FT120100832"]}],"id":[{"id":"10.13039\/501100007290","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Discovery Projects","award":["DP180102050 and DP180103332"],"award-info":[{"award-number":["DP180102050 and DP180103332"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2019,5,31]]},"abstract":"<jats:p>\n            In the past decade, positioning system-enabled devices such as smartphones have become most prevalent. This functionality brings the increasing popularity of\n            <jats:italic>location-based services<\/jats:italic>\n            in business as well as daily applications such as navigation, targeted advertising, and location-based social networking.\n            <jats:italic>Continuous spatial queries<\/jats:italic>\n            serve as a building block for location-based services. As an example, an Uber driver may want to be kept aware of the nearest customers or service stations. Continuous spatial queries require updates to the query result as the query or data objects are moving. This poses challenges to the query efficiency, which is crucial to the user experience of a service. A large number of approaches address this efficiency issue using the concept of\n            <jats:italic>safe region<\/jats:italic>\n            . A safe region is a region within which arbitrary movement of an object leaves the query result unchanged. Such a region helps reduce the frequency of query result update and hence improves query efficiency. As a result, safe region-based approaches have been popular for processing various types of continuous spatial queries. Safe regions have interesting theoretical properties and are worth in-depth analysis. We provide a comparative study of safe region-based approaches. We describe how safe regions are computed for different types of continuous spatial queries, showing how they improve query efficiency. We compare the different safe region-based approaches and discuss possible further improvements.\n          <\/jats:p>","DOI":"10.1145\/3193835","type":"journal-article","created":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T15:08:42Z","timestamp":1527088122000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Continuous Spatial Query Processing"],"prefix":"10.1145","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6501-9050","authenticated-orcid":false,"given":"Jianzhong","family":"Qi","sequence":"first","affiliation":[{"name":"University of Melbourne, Parkville, VIC, Australia"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Melbourne, Parkville, VIC, Australia"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}]},{"given":"Kotagiri","family":"Ramamohanarao","sequence":"additional","affiliation":[{"name":"University of Melbourne, Parkville, VIC, Australia"}]},{"given":"Jiayuan","family":"HE","sequence":"additional","affiliation":[{"name":"University of Melbourne, Parkville, VIC, Australia"}]}],"member":"320","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424363"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2013.09.008"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00035-1"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2012.11.023"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/630396"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0182-x"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2791347.2791355"},{"key":"e_1_2_2_8_1","unstructured":"Android. 2017. Creating and Monitoring Geofences. Retrieved from https:\/\/developer.android.com\/training\/location\/geofencing.html.  Android. 2017. Creating and Monitoring Geofences. Retrieved from https:\/\/developer.android.com\/training\/location\/geofencing.html."},{"key":"e_1_2_2_9_1","unstructured":"Apple. 2017. Region Monitoring. Retrieved from https:\/\/developer.apple.com\/library\/content\/documentation\/UserExperience\/Conceptual\/LocationAwarenessPG\/RegionMonitoring\/RegionMonitoring.html.  Apple. 2017. Region Monitoring. Retrieved from https:\/\/developer.apple.com\/library\/content\/documentation\/UserExperience\/Conceptual\/LocationAwarenessPG\/RegionMonitoring\/RegionMonitoring.html."},{"key":"e_1_2_2_10_1","volume-title":"CORE: Continuous monitoring of reverse k nearest neighbors on moving objects in road networks. Computer and Information Science","author":"Attique M.","year":"2016","unstructured":"M. Attique , H.-J. Cho , and T.-S. Chung . 2016 . CORE: Continuous monitoring of reverse k nearest neighbors on moving objects in road networks. Computer and Information Science 2015, Roger Lee (Ed.). Springer International Publishing , Cham, 109--124. M. Attique, H.-J. Cho, and T.-S. Chung. 2016. CORE: Continuous monitoring of reverse k nearest neighbors on moving objects in road networks. Computer and Information Science 2015, Roger Lee (Ed.). Springer International Publishing, Cham, 109--124."},{"key":"e_1_2_2_11_1","volume-title":"Technical Report TR-66. TimeCenter.","author":"Benetis R.","year":"2001","unstructured":"R. Benetis , C. S. Jensen , G. Karciauskas , and S. Saltenis . 2001 . Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects . Technical Report TR-66. TimeCenter. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. 2001. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. Technical Report TR-66. TimeCenter."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646291.687087"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0166-4"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_2_2_16_1","unstructured":"S. B\u00f6rzs\u00f6nyi D. Kossmann and K. Stocker. 2001. The skyline operator. In ICDE. 421--430.   S. B\u00f6rzs\u00f6nyi D. Kossmann and K. Stocker. 2001. The skyline operator. In ICDE. 421--430."},{"key":"e_1_2_2_17_1","unstructured":"Y. Cai K. A. Hua and G. Cao. 2004. Processing range-monitoring queries on heterogeneous mobile objects. In MDM. 27--38.  Y. Cai K. A. Hua and G. Cao. 2004. Processing range-monitoring queries on heterogeneous mobile objects. In MDM. 27--38."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34002-4_2"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989363"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009474"},{"key":"e_1_2_2_21_1","doi-asserted-by":"crossref","unstructured":"M. A. Cheema L. Brankovic X. Lin W. Zhang and W. Wang. 2010. Multi-guarded safe zone: An effective technique to monitor moving circular range queries. In ICDE. 189--200.  M. A. Cheema L. Brankovic X. Lin W. Zhang and W. Wang. 2010. Multi-guarded safe zone: An effective technique to monitor moving circular range queries. In ICDE. 189--200.","DOI":"10.1109\/ICDE.2010.5447864"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.246"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0235-9"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465328"},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"L. Chen G. Cong X. Cao and K.-L. Tan. 2015. Temporal spatial-keyword top-k publish\/subscribe. In ICDE. 255--266.  L. Chen G. Cong X. Cao and K.-L. Tan. 2015. Temporal spatial-keyword top-k publish\/subscribe. In ICDE. 255--266.","DOI":"10.1109\/ICDE.2015.7113289"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_2_2_27_1","unstructured":"H.-J. Cho and C.-W. Chung. 2005. An efficient and scalable approach to CNN queries in a road network. In VLDB. 865--876.   H.-J. Cho and C.-W. Chung. 2005. An efficient and scalable approach to CNN queries in a road network. In VLDB. 865--876."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.008"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.113"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.104"},{"key":"e_1_2_2_31_1","volume-title":"M-tree: An efficient access method for similarity search in metric spaces. In VLDB. 426--435.","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . 1997 . M-tree: An efficient access method for similarity search in metric spaces. In VLDB. 426--435. P. Ciaccia, M. Patella, and P. Zezula. 1997. M-tree: An efficient access method for similarity search in metric spaces. In VLDB. 426--435."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2912572"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2009.47"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200010)36:3%3C156::AID-NET2%3E3.0.CO;2-L"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840357"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_2_2_39_1","doi-asserted-by":"crossref","unstructured":"B. Gedik and L. Liu. 2004. MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In EDBT. 67--87.  B. Gedik and L. Liu. 2004. MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In EDBT. 67--87.","DOI":"10.1007\/978-3-540-24741-8_6"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.153"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031255"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2593464"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0351-3"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0204-8"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.07.001"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442810.2442828"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_7"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066212"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.203"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396879"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.118"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670679.1670682"},{"key":"e_1_2_2_55_1","unstructured":"T. Imielinski and B. Badrinath. 1992. Querying in highly mobile distributed environments. In VLDB. 41--52.   T. Imielinski and B. Badrinath. 1992. Querying in highly mobile distributed environments. In VLDB. 41--52."},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315496"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138394.1138396"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/956676.956677"},{"key":"e_1_2_2_59_1","doi-asserted-by":"crossref","unstructured":"C. S. Jensen D. Lin and B. C. Ooi. 2004. Query and update efficient B-tree based indexing of moving objects. In VLDB. 768--779.   C. S. Jensen D. Lin and B. C. Ooi. 2004. Query and update efficient B-tree based indexing of moving objects. In VLDB. 768--779.","DOI":"10.1016\/B978-012088469-8.50068-1"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/648315.756357"},{"key":"e_1_2_2_61_1","doi-asserted-by":"crossref","unstructured":"M. R. Kolahdouzan and C. Shahabi. 2004a. Continuous k-nearest neighbor queries in spatial network databases. In STDBM. 33--40.  M. R. Kolahdouzan and C. Shahabi. 2004a. Continuous k-nearest neighbor queries in spatial network databases. In STDBM. 33--40.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316762"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-005-4575-8"},{"key":"e_1_2_2_64_1","doi-asserted-by":"crossref","unstructured":"N. Koudas B. C. Ooi K.-L. Tan and R. Zhang. 2004. Approximate NN queries on streams with guaranteed error\/performance bounds. In VLDB. 804--815.   N. Koudas B. C. Ooi K.-L. Tan and R. Zhang. 2004. Approximate NN queries on streams with guaranteed error\/performance bounds. In VLDB. 804--815.","DOI":"10.1016\/B978-012088469-8.50071-1"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-008-0212-5"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863939_17"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.140"},{"key":"e_1_2_2_68_1","volume-title":"INSQ: An influential neighbor set based moving kNN query processing system. In ICDE. 1338--1341.","author":"Li C.","year":"2016","unstructured":"C. Li , Y. Gu , J. Qi , G. Yu , R. Zhang , and Q. Deng . 2016 . INSQ: An influential neighbor set based moving kNN query processing system. In ICDE. 1338--1341. C. Li, Y. Gu, J. Qi, G. Yu, R. Zhang, and Q. Deng. 2016. INSQ: An influential neighbor set based moving kNN query processing system. In ICDE. 1338--1341."},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735473"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0803-6"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0046-1"},{"key":"e_1_2_2_73_1","first-page":"40","article-title":"Spatio-temporal access methods","volume":"26","author":"Mokbel M. F.","year":"2003","unstructured":"M. F. Mokbel , T. M. Ghanem , and W. G. Aref . 2003 . Spatio-temporal access methods . IEEE Data Eng. Bull. 26 , 2 (2003), 40 -- 49 . M. F. Mokbel, T. M. Ghanem, and W. G. Aref. 2003. Spatio-temporal access methods. IEEE Data Eng. Bull. 26, 2 (2003), 40--49.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007638"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2009.14"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.172"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066230"},{"key":"e_1_2_2_78_1","first-page":"46","article-title":"Spatio-temporal access methods: Part 2 (2003 - 2010)","volume":"33","author":"Nguyen-Dinh L.-V.","year":"2010","unstructured":"L.-V. Nguyen-Dinh , W. G. Aref , and M. F. Mokbel . 2010 . Spatio-temporal access methods: Part 2 (2003 - 2010) . IEEE Data Eng. Bull. 33 , 2 (2010), 46 -- 55 . L.-V. Nguyen-Dinh, W. G. Aref, and M. F. Mokbel. 2010. Spatio-temporal access methods: Part 2 (2003 - 2010). IEEE Data Eng. Bull. 33, 2 (2010), 46--55.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453973"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0163-0"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32055-7_32"},{"key":"e_1_2_2_83_1","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Okabe A.","year":"1992","unstructured":"A. Okabe , B. Boots , and K. Sugihara . 1992 . Spatial Tessellations: Concepts and Applications of Voronoi Diagrams . John Wiley & Sons, Inc. A. Okabe, B. Boots, and K. Sugihara. 1992. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Inc."},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/588011.588037"},{"key":"e_1_2_2_85_1","unstructured":"D. Pfoser C. S. Jensen and Y. Theodoridis. 2000. Novel approaches in query processing for moving object trajectories. In VLDB. 395--406.   D. Pfoser C. S. Jensen and Y. Theodoridis. 2000. Novel approaches in query processing for moving object trajectories. In VLDB. 395--406."},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1039840"},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"e_1_2_2_88_1","doi-asserted-by":"crossref","unstructured":"J. Rocha-Junior O. Gkorgkas S. Jonassen and K. N\u00f8rv\u00e5g. 2011. Efficient processing of top-k spatial keyword queries. In SSTD. 205--222.   J. Rocha-Junior O. Gkorgkas S. Jonassen and K. N\u00f8rv\u00e5g. 2011. Efficient processing of top-k spatial keyword queries. In SSTD. 205--222.","DOI":"10.1007\/978-3-642-22922-0_13"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920994"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2012.08.006"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0361-2"},{"key":"e_1_2_2_95_1","unstructured":"C. Smith. 2016. By the Numbers: 20 Important Foursquare Stats. Retrieved from http:\/\/expandedramblings.com\/index.php\/by-the-numbers-interesting-foursquare-user-stats\/.  C. Smith. 2016. By the Numbers: 20 Important Foursquare Stats. Retrieved from http:\/\/expandedramblings.com\/index.php\/by-the-numbers-interesting-foursquare-user-stats\/."},{"key":"e_1_2_2_96_1","doi-asserted-by":"crossref","unstructured":"Z. Song and N. Roussopoulos. 2001. K-nearest neighbor search for moving query point. In SSTD. 79--96.   Z. Song and N. Roussopoulos. 2001. K-nearest neighbor search for moving query point. In SSTD. 79--96.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564730"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287395"},{"key":"e_1_2_2_99_1","unstructured":"H. Wang and R. Zimmermann. 2007. Location-based query processing on moving objects in road networks. In VLDB. 321--332.  H. Wang and R. Zimmermann. 2007. Location-based query processing on moving objects in road networks. In VLDB. 321--332."},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.171"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735472"},{"key":"e_1_2_2_102_1","doi-asserted-by":"crossref","unstructured":"X. Wang Y. Zhang W. Zhang X. Lin and W. Wang. 2015. AP-tree: Efficiently support continuous spatial-keyword queries over stream. In ICDE. 1107--1118.  X. Wang Y. Zhang W. Zhang X. Lin and W. Wang. 2015. AP-tree: Efficiently support continuous spatial-keyword queries over stream. In ICDE. 1107--1118.","DOI":"10.1109\/ICDE.2015.7113360"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2014.02.003"},{"key":"e_1_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0358-x"},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/2445583.2445590"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767861"},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.128"},{"key":"e_1_2_2_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739083"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767829"},{"key":"e_1_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806427"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.92"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.10.001"},{"key":"e_1_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126617500712"},{"key":"e_1_2_2_114_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872812"},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.05.004"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497495"},{"key":"e_1_2_2_117_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978092"},{"key":"e_1_2_2_118_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0259-1"},{"key":"e_1_2_2_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498297"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3193835","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3193835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:15Z","timestamp":1750268955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3193835"}},"subtitle":["A Survey of Safe Region Based Techniques"],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":118,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5,31]]}},"alternative-id":["10.1145\/3193835"],"URL":"https:\/\/doi.org\/10.1145\/3193835","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"2016-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}