한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정규철 | - |
dc.contributor.author | 이종찬 | - |
dc.contributor.author | 박상준 | - |
dc.contributor.author | 김병기 | - |
dc.date.available | 2018-05-10T15:34:09Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 1738-6667 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/16212 | - |
dc.description.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. | - |
dc.publisher | (사)디지털산업정보학회 | - |
dc.relation.isPartOf | (사)디지털산업정보학회 논문지 | - |
dc.subject | Compact Binary Trie | - |
dc.subject | Binary Trie | - |
dc.subject | Treemap | - |
dc.subject | Leafmap | - |
dc.subject | Dummy Node | - |
dc.title | 한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성 | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | (사)디지털산업정보학회 논문지, v.5, no.2, pp.21 - 28 | - |
dc.identifier.kciid | ART001361154 | - |
dc.description.journalClass | 2 | - |
dc.citation.endPage | 28 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 21 | - |
dc.citation.title | (사)디지털산업정보학회 논문지 | - |
dc.citation.volume | 5 | - |
dc.contributor.affiliatedAuthor | 김병기 | - |
dc.subject.keywordAuthor | Compact Binary Trie | - |
dc.subject.keywordAuthor | Binary Trie | - |
dc.subject.keywordAuthor | Treemap | - |
dc.subject.keywordAuthor | Leafmap | - |
dc.subject.keywordAuthor | Dummy Node | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.