Abstract
In the past decade, positioning system-enabled devices such as smartphones have become most prevalent. This functionality brings the increasing popularity of location-based services in business as well as daily applications such as navigation, targeted advertising, and location-based social networking. Continuous spatial queries 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 safe region. 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.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Continuous SpatialQuery Processing: A Survey of Safe Region Based Techniques
- I. Afyouni, C. Ray, S. Ilarri, and C. Claramunt. 2012. Algorithms for continuous location-dependent and context-aware queries in indoor environments. In SIGSPATIAL. 329--338. Google ScholarDigital Library
- I. Afyouni, C. Ray, S. Ilarri, and C. Claramunt. 2014. A PostgreSQL extension for continuous path and range queries in indoor mobile environments. Pervasive Mobile Comput. 15, C (2014), 128--150. Google ScholarDigital Library
- P. K. Agarwal, L. Arge, and J. Erickson. 2003. Indexing moving points. J. Comput. Syst. Sci. 66, 1 (2003), 207--243. Google ScholarDigital Library
- H. Al-Khalidi, D. Taniar, J. Betts, and S. Alamri. 2013. On finding safe regions for moving range queries. Math. Comput. Model. 58, 5--6 (2013), 1449--1458.Google ScholarCross Ref
- H. Al-Khalidi, D. Taniar, J. Betts, and S. Alamri. 2014. Monitoring moving queries inside a safe region. Sci. World J. 2014 (2014). Google ScholarCross Ref
- M. E. Ali, E. Tanin, R. Zhang, and L. Kulik. 2010. A motion-aware approach for efficient evaluation of continuous queries on 3D object databases. VLDB J. 19, 5 (2010), 603--632. Google ScholarDigital Library
- D. Amagata, T. Hara, and S. Nishio. 2015. Distributed top-k query processing on multi-dimensional data with keywords. In SSDBM. 10:1--10:12. Google ScholarDigital Library
- Android. 2017. Creating and Monitoring Geofences. Retrieved from https://developer.android.com/training/location/geofencing.html.Google Scholar
- Apple. 2017. Region Monitoring. Retrieved from https://developer.apple.com/library/content/documentation/UserExperience/Conceptual/LocationAwarenessPG/RegionMonitoring/RegionMonitoring.html.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. 2002. Nearest neighbor and reverse nearest neighbor queries for moving objects. In International Database Engineering & Applications Symposium. 44--53. Google ScholarDigital Library
- R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. 2006. Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15, 3 (2006), 229--249. Google ScholarDigital Library
- M. D. Berg, M. V. Kreveld, M. Overmars, and O. C. Schwarzkopf. 2000. Computational Geometry: Algorithms and Applications. Springer. Google ScholarDigital Library
- C. Böhm, S. Berchtold, and D. A. Keim. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. Comput. Surv. 33, 3 (2001), 322--373. Google ScholarDigital Library
- S. Börzsönyi, D. Kossmann, and K. Stocker. 2001. The skyline operator. In ICDE. 421--430. Google ScholarDigital Library
- Y. Cai, K. A. Hua, and G. Cao. 2004. Processing range-monitoring queries on heterogeneous mobile objects. In MDM. 27--38.Google Scholar
- X. Cao, L. Chen, G. Cong, C. S. Jensen, Q. Qu, A. Skovsgaard, D. Wu, and M. L. Yiu. 2012. Spatial keyword querying. In ER. 16--29. Google ScholarDigital Library
- X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi. 2011. Collective spatial keyword querying. In SIGMOD. 373--384. Google ScholarDigital Library
- B. Chazelle and H. Edelsbrunner. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Trans. Comput. 100, 11 (1987), 1349--1354. Google ScholarDigital Library
- 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.Google Scholar
- M. A. Cheema, L. Brankovic, X. Lin, W. Zhang, and W. Wang. 2011. Continuous monitoring of distance-based range queries. IEEE Trans. Know. Data Eng. 23, 8 (2011), 1182--1199. Google ScholarDigital Library
- M. A. Cheema, W. Zhang, X. Lin, Y. Zhang, and X. Li. 2012. Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. VLDB J. 21, 1 (2012), 69--95. Google ScholarDigital Library
- L. Chen, G. Cong, and X. Cao. 2013a. An efficient query indexing mechanism for filtering geo-textual data. In SIGMOD. 749--760. Google ScholarDigital Library
- L. Chen, G. Cong, X. Cao, and K.-L. Tan. 2015. Temporal spatial-keyword top-k publish/subscribe. In ICDE. 255--266.Google Scholar
- L. Chen, G. Cong, C. S. Jensen, and D. Wu. 2013b. Spatial keyword query processing: An experimental evaluation. In PVLBD 6, 3 (2013), 217--228. Google ScholarDigital Library
- H.-J. Cho and C.-W. Chung. 2005. An efficient and scalable approach to CNN queries in a road network. In VLDB. 865--876. Google ScholarDigital Library
- H.-J. Cho, K. Ryu, and T.-S. Chung. 2014. An efficient algorithm for computing safe exit points of moving range queries in directed road networks. Inform. Syst. 41 (2014), 1--19. Google ScholarDigital Library
- F. M. Choudhury, Z. Bao, J. S. Culpepper, and T. Sellis. 2017. Monitoring the top-m rank aggregation of spatial objects in streaming queries. In ICDE. 585--596. Google ScholarCross Ref
- C.-Y. Chow, M. F. Mokbel, and H. V. Leong. 2011. On efficient and scalable support of continuous queries in mobile peer-to-peer environments. IEEE Trans. Mobile Comput. 10, 10 (2011), 1473--1487. Google ScholarDigital Library
- P. Ciaccia, M. Patella, and P. Zezula. 1997. M-tree: An efficient access method for similarity search in metric spaces. In VLDB. 426--435. Google ScholarDigital Library
- G. Cong and C. S. Jensen. 2016. Querying geo-textual data: Spatial keyword queries and beyond. In SIGMOD. 2207--2212. Google ScholarDigital Library
- G. Cong, C. S. Jensen, and D. Wu. 2009. Efficient retrieval of the top-k most relevant spatial web objects. PVLDB 2, 1 (2009), 337--348. Google ScholarDigital Library
- T. T. Do, K. A. Hua, and C. S. Lin. 2009. ExtRange: Continuous moving range queries in mobile peer-to-peer networks. In MDM. 317--322. Google ScholarDigital Library
- M. Erwig and F. Hagen. 2000. The graph voronoi diagram with applications. Networks 36, 3 (2000), 156--163. Google ScholarCross Ref
- R. A. Finkel and J. L. Bentley. 1974. Quad trees a data structure for retrieval on composite keys. Acta Inform. 4, 1 (1974), 1--9. Google ScholarDigital Library
- S. Fortune. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 1-4 (1987), 153--174. Google ScholarDigital Library
- V. Gaede and O. Günther. 1998. Multidimensional access methods. Comput. Surv. 30, 2 (1998), 170--231. Google ScholarDigital Library
- B. Gedik and L. Liu. 2004. MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In EDBT. 67--87.Google Scholar
- B. Gedik and L. Liu. 2006. MobiEyes: A distributed location monitoring service using moving location queries. IEEE Trans. Mobile Comput. 5, 10 (2006), 1384--1402. Google ScholarDigital Library
- B. Gedik, K.-L. Wu, P. Yu, and L. Liu. 2004. Motion adaptive indexing for moving continual queries over moving objects. In CIKM. 427--436. Google ScholarDigital Library
- Y. Gu, G. Liu, J. Qi, H. Xu, G. Yu, and R. Zhang. 2016a. The moving k diversified nearest neighbor query. IEEE Trans. Knowl. Data Eng. 28, 10 (2016), 2778--2792. Google ScholarDigital Library
- Y. Gu, H. Zhang, Z. Wang, and G. Yu. 2016b. Efficient moving k nearest neighbor queries over line segment objects. World Wide Web 19, 4 (2016), 653--677. Google ScholarDigital Library
- L. Guo, J. Shao, H. Aung, and K.-L. Tan. 2015. Efficient continuous top-k spatial keyword queries on road networks. GeoInformatica 19, 1 (2015), 29--60. Google ScholarDigital Library
- A. Guttman. 1984. R-trees: A dynamic index structure for spatial searching. In SIGMOD. 47--57. Google ScholarDigital Library
- T. Hashem, L. Kulik, and R. Zhang. 2013. Countering overlapping rectangle privacy attack for moving kNN queries. Inform. Syst. 38, 3 (2013), 430--453. Google ScholarDigital Library
- A. M. Hendawi and M. F. Mokbel. 2012. Predictive spatio-temporal queries: A comprehensive survey and future directions. In International Workshop on Mobile Geographic Information Systems. 97--104. Google ScholarDigital Library
- G. R. Hjaltason and H. Samet. 1999. Distance browsing in spatial databases. ACM Trans. Database Syst. 24, 2 (1999), 265--318. Google ScholarDigital Library
- Y.-L. Hsueh, R. Zimmermann, and W.-S. Ku. 2009. Adaptive safe regions for continuous spatial queries over moving objects. In DASFAA. 71--76. Google ScholarDigital Library
- H. Hu, J. Xu, and D. L. Lee. 2005. A generic framework for monitoring continuous spatial queries over moving objects. In SIGMOD. 479--490. Google ScholarDigital Library
- J.-L. Huang and C.-C. Huang. 2013. A proxy-based approach to continuous location-based spatial queries in mobile environments. IEEE Trans. Knowl. Data Eng. 25, 2 (2013), 260--273. Google ScholarDigital Library
- W. Huang, G. Li, K.-L. Tan, and J. Feng. 2012. Efficient safe-region construction for moving top-k spatial keyword queries. In CIKM. 932--941. Google ScholarDigital Library
- S. Ilarri, E. Mena, and A. Illarramendi. 2006. Location-dependent queries in mobile contexts: Distributed processing using mobile agents. IEEE Trans. Mobile Comput. 5, 8 (2006), 1029--1043. Google ScholarDigital Library
- S. Ilarri, E. Mena, and A. Illarramendi. 2010. Location-dependent query processing: Where we are and where we are heading. Comput. Surv. 42, 3 (2010), 12:1--12:73. Google ScholarDigital Library
- T. Imielinski and B. Badrinath. 1992. Querying in highly mobile distributed environments. In VLDB. 41--52. Google ScholarDigital Library
- G. S. Iwerks, H. Samet, and K. Smith. 2003. Continuous k-nearest neighbor queries for continuously moving points with updates. In VLDB. 512--523. Google ScholarDigital Library
- G. S. Iwerks, H. Samet, and K. P. Smith. 2006. Maintenance of k-nn and spatial join queries on continuously moving points. ACM Trans. Database Syst. 31, 2 (2006), 485--536. Google ScholarDigital Library
- C. S. Jensen, J. Kolárvr, T. B. Pedersen, and I. Timko. 2003. Nearest neighbor queries in road networks. In GIS. 1--8. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- D. V. Kalashnikov, S. Prabhakar, S. E. Hambrusch, and W. G. Aref. 2002. Efficient evaluation of continuous range queries on moving objects. In DEXA. 731--740. Google ScholarDigital Library
- M. R. Kolahdouzan and C. Shahabi. 2004a. Continuous k-nearest neighbor queries in spatial network databases. In STDBM. 33--40.Google Scholar
- M. R. Kolahdouzan and C. Shahabi. 2004b. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB. 840--851. Google ScholarDigital Library
- M. R. Kolahdouzan and C. Shahabi. 2005. Alternative solutions for continuous k nearest neighbor queries in spatial network databases. GeoInformatica 9, 4 (2005), 321--341. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Krumm. 2009. A survey of computational location privacy. Pers. Ubiquitous Comput. 13, 6 (2009), 391--399. Google ScholarDigital Library
- L. Kulik and E. Tanin. 2006. Incremental rank updates for moving query points. In GIScience. 251--268. Google ScholarDigital Library
- J. Lee, S. Kang, Y. Lee, S. J. Lee, and J. Song. 2009. BMQ-processor: A high-performance border-crossing event detection framework for large-scale monitoring applications. IEEE Trans. Know. Data Eng. 21, 2 (2009), 234--252. Google ScholarDigital Library
- 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.Google Scholar
- C. Li, Y. Gu, J. Qi, G. Yu, R. Zhang, and W. Yi. 2014. Processing moving kNN queries using influential neighbor sets. PVLDB 8, 2 (2014), 113--124. Google ScholarDigital Library
- C. Li, Y. Gu, J. Qi, and G. Yu. 2015. A safe region based approach to moving KNN queries in obstructed space. Know. Inform. Syst. 45, 2 (2015), 417--451. Google ScholarDigital Library
- Z. Li, K. C. K. Lee, B. Zheng, W.-C. Lee, D. Lee, and X. Wang. 2011. IR-tree: An efficient index for geographic document search. IEEE Trans. Knowl. Data En. 23, 4 (2011), 585--599. Google ScholarDigital Library
- M. F. Mokbel and W. G. Aref. 2008. SOLE: Scalable on-line execution of continuous queries on spatio-temporal data streams. VLDB J. 17, 5 (2008), 971--995. Google ScholarDigital Library
- M. F. Mokbel, T. M. Ghanem, and W. G. Aref. 2003. Spatio-temporal access methods. IEEE Data Eng. Bull. 26, 2 (2003), 40--49.Google Scholar
- M. F. Mokbel, X. Xiong, and W. G. Aref. 2004. SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. In SIGMOD. 623--634. Google ScholarDigital Library
- K. Mouratidis, S. Bakiras, and D. Papadias. 2009. Continuous monitoring of spatial queries in wireless broadcast environments. IEEE Trans. Mobile Comput. 8, 10 (2009), 1297--1311. Google ScholarDigital Library
- K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao. 2005b. A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans. Knowl. Data Eng. 17, 11 (2005), 1451--1464. Google ScholarDigital Library
- K. Mouratidis, D. Papadias, and M. Hadjieleftheriou. 2005a. Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In SIGMOD. 634--645. Google ScholarDigital Library
- 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.Google Scholar
- J. Nievergelt, H. Hinterberger, and K. C. Sevcik. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1 (1984), 38--71. Google ScholarDigital Library
- S. Nutanong, R. Zhang, E. Tanin, and L. Kulik. 2008. The V*-diagram: A query dependent approach to moving kNN queries. PVLDB 1, 1 (2008), 1095--1106. Google ScholarDigital Library
- S. Nutanong, R. Zhang, E. Tanin, and L. Kulik. 2010. Analysis and evaluation of V*-kNN: An efficient algorithm for moving kNN queries. VLDB J. 19, 3 (2010), 307--332. Google ScholarDigital Library
- Y. Ohsawa and H. Htoo. 2016. Versatile safe-region generation method for continuous monitoring of moving objects in the road network distance. In DASFAA. 377--392. Google ScholarCross Ref
- A. Okabe, B. Boots, and K. Sugihara. 1992. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Inc. Google ScholarDigital Library
- J. Orenstein and T. Merrett. 1984. A class of data structures for associative searching. In PODS. 181--190. Google ScholarDigital Library
- D. Pfoser, C. S. Jensen, and Y. Theodoridis. 2000. Novel approaches in query processing for moving object trajectories. In VLDB. 395--406. Google ScholarDigital Library
- S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch. 2002. Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects. IEEE Trans. Comput. 51, 10 (2002), 1124--1140. Google ScholarDigital Library
- F. P. Preparata and M. Shamos. 1985. Computational Geometry: An Introduction. Springer. Google ScholarDigital Library
- J. Rocha-Junior, O. Gkorgkas, S. Jonassen, and K. Nørvåg. 2011. Efficient processing of top-k spatial keyword queries. In SSTD. 205--222. Google ScholarDigital Library
- N. Roussopoulos, S. Kelley, and F. Vincent. 1995. Nearest neighbor queries. In SIGMOD. 71--79. Google ScholarDigital Library
- S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. 2000. Indexing the positions of continuously moving objects. In SIGMOD. 331--342. Google ScholarDigital Library
- R. Seidel. 1988. Constrained Delaunay Triangulations and Voronoi Diagrams with Obstacles. Technical Report 260. IIG-TU Graz, Austria.Google Scholar
- M. Sharifzadeh and C. Shahabi. 2010. VoR-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. PVLDB 3, 1--2 (2010), 1231--1242. Google ScholarDigital Library
- R. I. D. Silva, D. F. Macedo, and J. M. S. Nogueira. 2014. Spatial query processing in wireless sensor network—A survey. Inform. Fusion 15 (2014), 32--43. Google ScholarDigital Library
- A. P. Sistla, O. Wolfson, and B. Xu. 2015. Continuous nearest-neighbor queries with location uncertainty. VLDB J. 24, 1 (2015), 25--50. Google ScholarDigital Library
- C. Smith. 2016. By the Numbers: 20 Important Foursquare Stats. Retrieved from http://expandedramblings.com/index.php/by-the-numbers-interesting-foursquare-user-stats/.Google Scholar
- Z. Song and N. Roussopoulos. 2001. K-nearest neighbor search for moving query point. In SSTD. 79--96. Google ScholarDigital Library
- Y. Tao and D. Papadias. 2002. Time-parameterized queries in spatio-temporal databases. In SIGMOD. 334--345. Google ScholarDigital Library
- Y. Tao, D. Papadias, and Q. Shen. 2002. Continuous nearest neighbor search. In VLDB. 287--298. Google ScholarDigital Library
- H. Wang and R. Zimmermann. 2007. Location-based query processing on moving objects in road networks. In VLDB. 321--332.Google Scholar
- H. Wang and R. Zimmermann. 2011. Processing of continuous location-based range queries on moving objects in road networks. IEEE Trans. Knowl. Data Eng. 23, 7 (2011), 1065--1078. Google ScholarDigital Library
- X. Wang, Y. Zhang, W. Zhang, X. Lin, and W. Wang. 2014b. Selectivity estimation on streaming spatio-textual data using local correlations. PVLDB 8, 2 (2014), 101--112. Google ScholarDigital Library
- 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.Google Scholar
- Y. Wang, R. Zhang, C. Xu, J. Qi, Y. Gu, and G. Yu. 2014a. Continuous visible k nearest neighbor query on moving objects. Inform. Syst. 44 (2014), 1--21. Google ScholarCross Ref
- P. G. D. Ward, Z. He, R. Zhang, and J. Qi. 2014. Real-time continuous intersection joins over large sets of moving objects using graphic processing units. VLDB J. 23, 6 (2014), 965--985. Google ScholarDigital Library
- D. Wu, M. L. Yiu, and C. S. Jensen. 2013. Moving spatial keyword queries: Formulation, methods, and analysis. ACM Trans. Database Syst. 38, 1 (2013), 7:1--7:47. Google ScholarDigital Library
- D. Wu, M. L. Yiu, C. S. Jensen, and G. Cong. 2011. Efficient continuously moving top-k spatial keyword query processing. In ICDE. 541--552. Google ScholarDigital Library
- X. Xiong, M. F. Mokbel, and W. G. Aref. 2005. SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In ICDE. 643--654. Google ScholarDigital Library
- B. Yang, H. Lu, and C. S. Jensen. 2010. Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space. In EDBT. 335--346. Google ScholarDigital Library
- M. L. Yiu, E. Lo, and D. Yung. 2011. Authentication of moving kNN queries. In ICDE. 565--576. Google ScholarDigital Library
- M. Yu, G. Li, and J. Feng. 2015. A cost-based method for location-aware publish/subscribe services. In CIKM. 693--702. Google ScholarDigital Library
- X. Yu, K. Q. Pu, and N. Koudas. 2005. Monitoring k-nearest neighbor queries over moving objects. In ICDE. 631--642. Google ScholarDigital Library
- D. Yung, M. L. Yiu, and E. Lo. 2012. A safe-exit approach for efficient network-based moving range queries. Data Knowl. Eng. 72 (2012), 126--147. Google ScholarDigital Library
- K. Zeberga, R. Jin, H.-J. Cho, and T.-S. Chung. 2017. A safe-region approach to a moving k-rnn queries in a directed road network. J. Circuits, Syst. Comput. 26, 5 (2017), 1--18. Google ScholarCross Ref
- J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. L. Lee. 2003. Location-based spatial queries. In SIGMOD. 443--454. Google ScholarDigital Library
- R. Zhang, H. V. Jagadish, B. T. Dai, and K. Ramamohanarao. 2010. Optimized algorithms for predictive range and kNN queries on moving objects. Information Systems 35, 8 (2010), 911--932. Google ScholarDigital Library
- R. Zhang, D. Lin, R. Kotagiri, and E. Bertino. 2008. Continuous intersection joins over moving objects. In ICDE. 863--872. Google ScholarDigital Library
- R. Zhang, B. C. Ooi, and K.-L. Tan. 2004. Making the pyramid technique robust to query types and workloads. In ICDE. 313--324. Google ScholarDigital Library
- R. Zhang, J. Qi, D. Lin, W. Wang, and R. C.-W. Wong. 2012. A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J. 21, 4 (2012), 561--586. Google ScholarDigital Library
- B. Zheng, K. Zheng, X. Xiao, H. Su, H. Yin, X. Zhou, and G. Li. 2016. Keyword-aware continuous kNN query on road networks. In ICDE. 871--882. Google ScholarCross Ref
Index Terms
Continuous Spatial Query Processing: A Survey of Safe Region Based Techniques
Recommendations
Distributed processing of continuous range queries
ICUIMC '14: Proceedings of the 8th International Conference on Ubiquitous Information Management and CommunicationThis paper addresses the problem of efficient processing of continuous range queries over moving objects. Existing server-centric methods increase the server workload and entail a huge amount of communication cost when the number of moving objects is ...
A continuous reverse skyline query processing considering the mobility of query objects
IDCS'12: Proceedings of the 5th international conference on Internet and Distributed Computing SystemsWith the development of location-based services, various query processing methods for moving objects have been studied. Particularly, a reverse skyline query that is the variation of the skyline query has been receiving much attention these days. ...
Spatial inverse query processing
Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database ...
Comments