Multi-Approximate-Keyword Routing in GIS Data

Provided by: Association for Computing Machinery
Topic: Big Data
Format: PDF
For GIS data situated on a road network, shortest path search is a basic operation. In practice, however, users are often interested at routing when certain constraints on the textual information have been also incorporated. This paper complements the standard shortest path search with multiple keywords and an approximate string similarity function, where the goal is to find the shortest path that passes through at least one matching object per keyword; they dub this problem the multi-approximate-keyword routing query.

Find By Topic