Answering k-NN Query of Chinese Calligraphic Character Based on Data Grid

Abstract

In this paper, a novel k-Nearest Neighbor (k-NN) query over the Chinese calligraphic character databases based on Data Grid is proposed. First when user in the query node submits a query character and k, the character filtering algorithm is performed using the hybrid distance metric (HDM) index. Then the candidate characters are transferred to the executing nodes in a package mode. Furthermore, the refinement process of the candidate characters is conducted in parallelism to get the answer set. Finally, the answer set is transferred to the query node. If the number of answer set is less than k, then the query procedure is re-performed by increasing the query radius until the k nearest neighbor characters are obtained. The analysis and experimental results show that the performance of the algorithm is good in minimizing the response time by decreasing network transfer cost and increasing parallelism of I/O and CPU.