Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Dynamic Hashing Algorithm for Retrieval Using Hangeul Name on Navigation System

  • Lee, Jung-Hwa (Department of Computer software engineering, Dongeui University)
  • Received : 2011.05.23
  • Accepted : 2011.06.07
  • Published : 2011.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, a name retrieval function is widely used on navigation systems. In this paper, we propose the new dynamic hashing algorithm for a name retrieval function on it. The proposed dynamic hashing algorithm by constructing an index using the variance information of character is the better than existing methods in terms of storage capacity and retrieval speed. The algorithm proposed in this paper can be useful on systems that have limited resources as well as navigation systems.

Keywords

References

  1. Taijin Yoon, Hwan-Gue Cho and Wookeun Chung, "A Phonemebased Approximate String Searching System for Restricted Korean Character Input Environments", Journal of KISS, vol. 37, No, 10, pp.788-801, 2010.
  2. Gollapudi, S. and Panigrahy, R. ,"A Dictionary for Approximate String Search and Longest Prefix Search", CIKM International Conference, Vol.15, pp.768-775, 2006.
  3. Paolo Ferragina and Roberto Grossi. "The String B-Tree: a new data structure for string search in external memory and its applications," Journal of the ACM, vol. 46(2), pp.236-280, 1999 https://doi.org/10.1145/301970.301973
  4. Kyeonghwan Kim, "High-Speed Korean Address Searching System for Efficient Delivery Point Code Generation," The KIPS Transaction, Vol.8, No.3, pp.273-284, 2001
  5. Hiecheol Kim, Jeonghun Shin, Yong-Doo Lee, "Construction of Korean Dictionary Using Multi-dimensional Binary Tree", Conf. of KISS, Vol. 25, No.1(B), pp. 452 - 454, 1998.
  6. Paolo Ferragina and Roberto Grossi. "The String B-Tree: a new data structure for string search in external memory and its applications", Journal of the ACM, vol. 46(2), pp.236-280, 1999. https://doi.org/10.1145/301970.301973
  7. Cheol-Su Kim, Woojeong Bae, Yong-seok Lee, Jun-ichi Aoe, "Construction of Korean Electronic Dictionary Using Double-array Trei Structure", Journal of KISS(B), Vol. 23 ,No. 1, pp. 85-94, 1996.
  8. Ronnblom, J., "High-error approximate dictionary search using estimate hash comparisons", Software:Practice and Experience, Vol.37 No.10, pp.1047-1059, 2007. https://doi.org/10.1002/spe.797
  9. Martine Dietzfelbinger, Marine Huhne, "A dictionary implementation based on dynamic perfect hashing", Journal Journal of Experimental Algorithmics (JEA), Vol.12, June, 2008.
  10. Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan, " Dynamic Perfect Hashing: Upper and Lower Bounds", SIAM J. Comput.. Vol. 23, pp. 738-761, 2007
  11. ShinWoo Kim, YongKyu Lee, " An implementation and evaluation of large-scale dynamic hashing directories", Journal of Korea Multimedia Society, Vol.8, No.7, pp.924-942, 2005
  12. Jung-hwa Lee, "Character based Hangeul search using Location specific Character Frequency", International Journal of KIMICS, Vol. 7, No. 3, pp.345-350, 2009+