한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성
Reconstitution of Compact Binary trie for the Efficient Retrieval of Hangul UniCODE Text
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
This paper proposes RCBT(Reduced Compact Binary trie) to correct faults of CBT (Compact Binary trie). First, in the case of CBT, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nodes used in balancing trees. On the other hand, if the HCBT realized hierarchically, given certain depth to prevent the map from increasing onthe right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CBT and of many tree links. In the case of RCBT in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.
Abstract
This paper proposes RCBT(Reduced Compact Binary trie) to correct faults of CBT (Compact Binary trie). First, in the case of CBT, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nodes used in balancing trees. On the other hand, if the HCBT realized hierarchically, given certain depth to prevent the map from increasing onthe right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CBT and of many tree links. In the case of RCBT in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.
참고문헌 (13)
- 강성윤, "자바 모바일 프로그래밍" (2002), 대림
- 김철수, "절단검색을 지원하는 전자사전 구조", 정보과학회논문지 : 컴퓨팅의 실제 및 레터, 9(1), pp.60~69 (2003), 한국정보과학회
- Aho A. V., "DataStructuresandAlgorithms" (1983), Addison-Wesley
- Aoe J., "A Trie Compaction Algorithm for a Large Set of Keys", IEEE Transactions on Knowledge and DataEngineering, 8(3), pp.476~491 (1996)
- 리처드 헌터, "유비쿼터스 공유와 감시의 두얼굴" (2003), 21세기 북스
- 문봉재, "모바일 디바이스에서 닷넷 애플리케이션 구축하기" (2003), Microsoft Press
- 정규철, "CBDS 트리를 이용한 모바일 기기용 저용량 사전 구현에 관한 연구", 한국컴퓨터정보학회논문지, 10(5), pp.33~40 (2005), 한국컴퓨터정보학회
- 김윤명, "뇌를 자극하는 Java 프로그래밍" (2006), 한빛미디어
- Masami, S., "An Order Searching Algorithm of Extensible Hashing", Inter. j. Computer Math., 63, pp.179~201 (1997)
- Aoe, J, "A trie compaction algorithm for a large set of keys", IEEE Trans. on Knowledge and Data Engineering, 8(3) (1996)
- Jonge, W. D, "Two access methods using compact binary tree", IEEE Trans. on Software Engineering, 13(7), pp.7999~7809 (1987)
- Jung. M, "ADynamicConstructionAlgorithmfortheCompactPatriciaTr ieUsingtheHierarchicalStructure", Information Processing & Management, 38(2), pp.221~236