Speeding up similarity queries over large Chinese calligraphic character databases using data grid

Yi Zhuang, Yueting Zhuang, Qing Li, Fei Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

This paper proposes a novel data-grid-based k nearest neighbor query over large Chinese calligraphic character databases, which can significantly speed up the retrieval efficiency. Three steps are made. Firstly, when a user submits a query request to a query node, a process of character set reduction is performed using iDistance index in different data nodes, followed by sending the candidate characters to the executing nodes through a package-based transfer technique. Secondly, a refinement process of the candidate characters is conducted in the executing nodes in parallel to get the answer set. Finally, the answer set is transferred to the query node. The proposed method incorporates a uniform-start-distance-based character data allocation policy and character reduction algorithm. The analysis and experimental results show that the performance of the algorithm is effective in minimizing the response time by decreasing network transfer cost and increasing the parallelism of I/O and CPU.

Original languageEnglish
Title of host publicationProceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007
Pages499-506
Number of pages8
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event6th International Conference on Grid and Cooperative Computing, GCC 2007 - Urumchi, Xinjiang, China
Duration: 16 Aug 200718 Aug 2007

Publication series

NameProceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007

Conference

Conference6th International Conference on Grid and Cooperative Computing, GCC 2007
CountryChina
CityUrumchi, Xinjiang
Period16/08/0718/08/07

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this