한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성
- Authors
- 정규철; 이종찬; 박상준; 김병기
- Issue Date
- 2009
- Publisher
- (사)디지털산업정보학회
- Keywords
- Compact Binary Trie; Binary Trie; Treemap; Leafmap; Dummy Node
- Citation
- (사)디지털산업정보학회 논문지, v.5, no.2, pp.21 - 28
- Journal Title
- (사)디지털산업정보학회 논문지
- Volume
- 5
- Number
- 2
- Start Page
- 21
- End Page
- 28
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/16212
- ISSN
- 1738-6667
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/16212)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.