Safest Nearby Neighbor Queries in Road Networks
Pages 7270 - 7284
Abstract
Safety on the roads has become a major concern in recent days. Travellers prefer to avoid road inconveniences that may occur from crime incidents, street harassment, protests or riots during unrest in a country. To facilitate safe travel, we introduce a novel query for road networks called the <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> safest nearby neighbor (SNN) query. Given a query location <inline-formula> <tex-math notation="LaTeX">$v_{l}$ </tex-math></inline-formula>, a distance constraint <inline-formula> <tex-math notation="LaTeX">$d_{c}$ </tex-math></inline-formula> and a point of interest <inline-formula> <tex-math notation="LaTeX">$p_{i}$ </tex-math></inline-formula>, we define the safest path from <inline-formula> <tex-math notation="LaTeX">$v_{l}$ </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">$p_{i}$ </tex-math></inline-formula> as the path with the highest <italic>path safety score</italic> among all the paths from <inline-formula> <tex-math notation="LaTeX">$v_{l}$ </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">$p_{i}$ </tex-math></inline-formula> with length less than <inline-formula> <tex-math notation="LaTeX">$d_{c}$ </tex-math></inline-formula>. The path safety score is computed considering the road safety of each road segment on the path. Given a query location <inline-formula> <tex-math notation="LaTeX">$v_{l}$ </tex-math></inline-formula>, a distance constraint <inline-formula> <tex-math notation="LaTeX">$d_{c}$ </tex-math></inline-formula> and a set of POIs <inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>, a <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>SNN query returns <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> POIs with the <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> highest path safety scores in <inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula> along with their respective safest paths from the query location. We develop two novel indexing structures called <inline-formula> <tex-math notation="LaTeX">$Ct$ </tex-math></inline-formula>-tree and a safety score based Voronoi diagram (SNVD). We propose two efficient query processing algorithms each exploiting one of the proposed indexes to effectively refine the search space using the properties of the index. Our extensive experimental study on real datasets demonstrates that our solution is on average an order of magnitude faster than the baseline.
References
[1]
C. H. Stubbert, S. F. Pires, and R. T. Guerette, “Crime science and crime epidemics in developing countries: A reflection on kidnapping for ransom in,” Crime Sci., vol. 4, no. 1, pp. 1–11, Dec. 2015.
[2]
M. Natarajan, “Crime in developing countries: The contribution of crime science,” Crime Sci., vol. 5, no. 1, pp. 1–5, Dec. 2016.
[3]
V. Spicer, J. Song, P. Brantingham, A. Park, and M. A. Andresen, “Street profile analysis: A new method for mapping crime on major roadways,” Appl. Geogr., vol. 69, pp. 65–74, Apr. 2016.
[4]
BBC. (Oct. 23, 2018). Street Harassment ‘Relentless’ For Women and Girls. [Online]. Available: https://www.bbc.com/news/uk-politics-45942447
[5]
Plan International. (Apr. 20, 2020). 1 in 5 Girls Have Experienced Street Harassment During Lockdown. [Online]. Available: https://plan-uk.org/media-centre/1-in-5-girls-have-experienced-street-harassment-during-lockdown
[6]
S. Aljubayrin, J. Qi, C. S. Jensen, R. Zhang, Z. He, and Y. Li, “Finding lowest-cost paths in settings with safe and preferred zones,” VLDB J., vol. 26, no. 3, pp. 373–397, Jun. 2017.
[7]
S. Aljubayrin, J. Qi, C. S. Jensen, R. Zhang, Z. He, and Z. Wen, “The safest path via safe zones,” in Proc. ICDE, Apr. 2015, pp. 531–542.
[8]
J. Kim, M. Cha, and T. Sandholm, “SocRoutes: Safe routes based on tweet sentiments,” in Proc. WWW, Apr. 2014, pp. 179–182.
[9]
F. T. Islam, T. Hashem, and R. Shahriyar, “A privacy-enhanced and personalized safe route planner with crowdsourced data and computation,” in Proc. ICDE, Apr. 2021, pp. 229–240.
[10]
A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proc. SIGMOD, 1984, pp. 47–57.
[11]
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An efficient and robust access method for points and rectangles,” ACM SIGMOD Rec., vol. 19, no. 2, pp. 322–331, Jun. 1990.
[12]
K. C. K. Lee, W.-C. Lee, B. Zheng, and Y. Tian, “ROAD: A new spatial object search framework for road networks,” IEEE Trans. Knowl. Data Eng., vol. 24, no. 3, pp. 547–560, Mar. 2012.
[13]
R. Zhong, G. Li, K. L. Tan, L. Zhou, and Z. Gong, “G-tree: An efficient and scalable index for spatial search on road networks,” IEEE Trans. Knowl. Data Eng., vol. 27, no. 8, pp. 2175–2189, Aug. 2015.
[14]
Z. Li, L. Chen, and Y. Wang, “G*-tree: An efficient spatial index on road networks,” in Proc. ICDE, Apr. 2019, pp. 268–279.
[15]
T. Dan, C. Luo, Y. Li, Z. Guan, and X. Meng, “LG-tree: An efficient labeled index for shortest distance search on massive road networks,” IEEE Trans. Intell. Transp. Syst., vol. 23, no. 12, pp. 23721–23735, Dec. 2022.
[16]
X. Min, D. Pfoser, A. Züfle, and Y. Sheng, “A hierarchical spatial network index for arbitrarily distributed spatial objects,” ISPRS Int. J. Geo-Inf., vol. 10, no. 12, p. 814, Dec. 2021.
[17]
D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query processing in spatial network databases,” in Proc. VLDB, 2003, pp. 802–813.
[18]
M. R. Kolahdouzan and C. Shahabi, “Voronoi-based K nearest neighbor search for spatial network databases,” in Proc. VLDB, 2004, pp. 1–12.
[19]
S. Chainey and J. Ratcliffe, GIS and Crime Mapping. Hoboken, NJ, USA: Wiley, 2013.
[20]
E. Galbrun, K. Pelechrinis, and E. Terzi, “Urban navigation beyond shortest route: The case of safe paths,” Inf. Syst., vol. 57, pp. 160–171, Apr. 2016.
[21]
E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., vol. 1, no. 1, pp. 269–271, Oct. 1959.
[22]
S. Nadi and M. R. Delavar, “Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators,” Int. J. Appl. Earth Observ. Geoinf., vol. 13, no. 3, pp. 322–335, Jun. 2011.
[23]
C. Salgado, M. A. Cheema, and D. Taniar, “An efficient approximation algorithm for multi-criteria indoor route planning queries,” in Proc. SIGSPATIAL, Nov. 2018, pp. 448–451.
[24]
B. Shen, M. A. Cheema, D. Harabor, and P. J. Stuckey, “Euclidean pathfinding with compressed path databases,” in Proc. IJCAI, Jul. 2020, pp. 4229–4235.
[25]
A. Lambert and D. Gruyer, “Safe path planning in an uncertain-configuration space,” in Proc. ICRA, 2003, pp. 4185–4190.
[26]
L. Leenen, A. Terlunen, and H. L. Roux, “A constraint programming solution for the military unit path finding problem,” in Mobile Intelligent Autonomous Systems. Boca Raton, FL, USA: CRC Press, 2012, pp. 225–240.
[27]
J. P. van den Berg and M. H. Overmars, “Planning the shortest safe path amidst unpredictably moving obstacles,” in Algorithmic Foundation of Robotics VII. Manhattan, NY, USA: Springer, 2006, pp. 103–118.
[28]
A. Anwar and T. Hashem, “Optimal obstructed sequenced route queries in spatial databases,” in Proc. EDBT, 2017, pp. 522–525.
[29]
L. Li, M. A. Cheema, H. Lu, M. E. Ali, and A. N. Toosi, “Comparing alternative route planning techniques: A comparative user study on road networks,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 11, pp. 5552–5557, Nov. 2022.
[30]
L. Li, M. A. Cheema, M. E. Ali, H. Lu, and D. Taniar, “Continuously monitoring alternative shortest paths on road networks,” Proc. VLDB Endowment, vol. 13, no. 12, pp. 2243–2255, Aug. 2020.
[31]
Z. Luo, L. Li, M. Zhang, W. Hua, Y. Xu, and X. Zhou, “Diversified top-k route planning in road network,” Proc. VLDB Endowment, vol. 15, no. 11, pp. 3199–3212, Jul. 2022.
[32]
T. Hashem, T. Hashem, M. E. Ali, and L. Kulik, “Group trip planning queries in spatial databases,” in Proc. SSTD, 2013, pp. 259–276.
[33]
M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi, “The optimal sequenced route query,” VLDB J., vol. 17, no. 4, pp. 765–787, Jul. 2008.
[34]
H. Zhu, W. Li, W. Liu, J. Yin, and J. Xu, “Top k optimal sequenced route query with POI preferences,” Data Sci. Eng., vol. 7, no. 1, pp. 3–15, Mar. 2022.
[35]
K. Fu, Y.-C. Lu, and C.-T. Lu, “TREADS: A safe route recommender using social media mining and text summarization,” in Proc. SIGSPATIAL, Nov. 2014, pp. 557–560.
[36]
S. Shah, F. Bao, C.-T. Lu, and I.-R. Chen, “CROWDSAFE: Crowd sourcing of crime incidents and safe routing on mobile devices,” in Proc. SIGSPATIAL, Nov. 2011, pp. 521–524.
[37]
G. Jossé, K. A. Schmid, A. Züfle, G. Skoumas, M. Schubert, and D. Pfoser, “Tourismo: A user-preference tourist trip search engine,” in Proc. SSTD, 2015, pp. 514–519.
[38]
E. Hossain, M. R. Karim, M. Hasan, S. A. Zaoad, T. Tanjim, and M. M. Khan, “SPaFE: A crowdsourcing and multimodal recommender system to ensure travel safety in a city,” IEEE Access, vol. 10, pp. 71221–71232, 2022.
[39]
R. Kauret al., “A navigation system for safe routing,” in Proc. MDM, Jun. 2021, pp. 240–243.
[40]
T. Abeywickrama, M. A. Cheema, and D. Taniar, “K-nearest neighbors on road networks: A journey in experimentation and in-memory implementation,” Proc. VLDB Endowment, vol. 9, no. 6, pp. 492–503, Jan. 2016.
[41]
P. Biswas, T. Hashem, and M. A. Cheema, “Safest nearby neighbor queries in road networks (full version),” 2021, arXiv:2107.14122.
[42]
R. Geisberger, P. Sanders, D. Schultes, and D. Delling, “Contraction hierarchies: Faster and simpler hierarchical routing in road networks,” in Proc. WEA, 2008, pp. 319–333.
[43]
R. A. Finkel and J. L. Bentley, “Quad trees a data structure for retrieval on composite keys,” Acta Inf., vol. 4, no. 1, pp. 1–9, 1974.
[44]
A. Okabe, B. Boots, K. Sugihara, S. N. Chiu, and D. G. Kendall, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. Hoboken, NJ, USA: Wiley, 2000.
[45]
A. Okabe, T. Satoh, T. Furuta, A. Suzuki, and K. Okano, “Generalized network Voronoi diagrams: Concepts, computational methods, and applications,” Int. J. Geograph. Inf. Sci., vol. 22, no. 9, pp. 965–994, 2008.
[46]
M. Safar, D. Ibrahimi, and D. Taniar, “Voronoi-based reverse nearest neighbor query processing on spatial networks,” Multimedia Syst., vol. 15, no. 5, pp. 295–308, Oct. 2009.
[47]
K. Xuan, G. Zhao, D. Taniar, B. Srinivasan, M. Safar, and M. Gavrilova, “Network Voronoi diagram based range search,” in Proc. AINA, 2009, pp. 741–748.
[48]
M. Erwig, “The graph Voronoi diagram with applications,” Networks, vol. 36, no. 3, pp. 156–163, 2000.
[49]
G. R. Hjaltason and H. Samet, “Distance browsing in spatial databases,” ACM Trans. Database Syst., vol. 24, no. 2, pp. 265–318, Jun. 1999.
[50]
Chicago Data Portal. (2019). Crimes—2001 to Present. Accessed: Apr. 26, 2021. [Online]. Available: https://data.cityofchicago.org/Public-Safety/Crimes-2001-to-Present/ijzp-q8t2
[51]
OpenDataPhilly. (2019). Crime Incidents. [Online]. Available: https://www.opendataphilly.org/dataset/crime-incidents
[52]
DataSF. (2018). Police Department Incident Reports: Historical 2003 to May 2018. [Online]. Available: https://data.sfgov.org/Public-Safety/Police-Department-Incident-Reports-Historical-2003/tmnf-yvry
[53]
L. Chen, G. Cong, C. S. Jensen, and D. Wu, “Spatial keyword query processing: An experimental evaluation,” Proc. VLDB Endowment, vol. 6, no. 3, pp. 217–228, 2013.
[54]
Z. Shao, M. A. Cheema, D. Taniar, H. Lu, and S. Yang, “Efficiently processing spatial and keyword queries in indoor venues,” IEEE Trans. Knowl. Data Eng., vol. 33, no. 9, pp. 3229–3244, Sep. 2021.
Recommendations
Monitoring path nearest neighbor in road networks
SIGMOD '09: Proceedings of the 2009 ACM SIGMOD International Conference on Management of dataThis paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new query returns the k-NN with respect to the shortest path connecting the ...
Top-k spatial keyword queries on road networks
EDBT '12: Proceedings of the 15th International Conference on Extending Database TechnologyWith the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial keyword queries. Given a set of objects with a textual description (e.g., ...
Probabilistic path queries in road networks: traffic uncertainty aware path selection
EDBT '10: Proceedings of the 13th International Conference on Extending Database TechnologyPath queries such as "finding the shortest path in travel time from my hotel to the airport" are heavily used in many applications of road networks. Currently, simple statistic aggregates such as the average travel time between two vertices are often ...
Comments
Information & Contributors
Information
Published In
1558-0016 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 01 July 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in