{'fraction_non_alphanumeric': 0.02171664943123061, 'fraction_numerical': 0.0, 'mean_word_length': 5.245161290322581, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Intelligent Path Finder for Goal Directed Queries in Spatial Networks

The Advancements in wireless technologies have led mobile users Geo-savvy. The integration of Geographical Information System (GIS) and Geo Positioning system (GPS) technologies and their wide use in mobile devices, car navigation systems, vehicle tracking system facilitates more users to search for geographical points of interest. The most popular location based application in road networks is k-Nearest Neighbor query. In this paper, a new Goal directed multi-constrained nearest neighbor query (GD-kNN) is introduced. The algorithm finds the data objects in the user direction of travel and shortest path to reach the data objects based on the dynamic constraints that are placed on allowable set of edges that appear on valid path (we restrict multimodal transport and types of roads). The algorithm returns nearest points of interest with their shortest network distance and travel times.