Online Multi-keywords Map-search Algorithm Based on Sub-region Method

Abstract

Abstract. Nowadays, the map-search technology is frequently used by people. However, present map-search service can hardlysatisfy people's growing demands. Providing multiplex service support in search service, such as intuitive search results and multi-keywords search, has become a research focus. This paperproposes a novel online multi-keywords map-search algorithm based on sub-region method. This algorithm makes up a graph of separate nodes and transfers the weight of keyword totheir adjacent nodes. When searching for sub-graph of a single keyword, it finds the node with the max weight then tries to accept or rejectits neighbors step by step. Duringthe search ofsub-graphs of multi-keywords, we must find the node with the max harmonic mean weight and union all the sub-graphs of single keyword it belongs to. This algorithm, based on sub-region method, can search multi-keywords in practical map-search experiments, and return several best resultsat the same time.