• Title/Summary/Keyword: CB 트리

Search Result 5, Processing Time 0.023 seconds

Enhancement of HCB Tree for Improving Retrieval Performance and Dynamic Environments (검색 성능 향상과 동적 환경을 위한 HCB 트리의 개선)

  • Kim, Sung Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.365-371
    • /
    • 2015
  • CB tree represents the binary trie by a compact binary sequence. However, retrieval time grows fast since the more keys stored in the trie, longer the binary sequences are. In addition it is inefficient for frequent key insertion/deletion. HCB tree is a hierarchical CB tree consisting of small binary tries. However it can not avoid shift operations and have to scan an additional table to refer child or parent trie. In order to improve retrieval performance and avoid shift operations when keys are inserted or deleted, we in this paper represent each separated trie by a full binary trie and then assign the unique identifier to it. Finally the theoretical evaluations show that both the proposed approach and HCB tree provides better than CB tree for key retrieval. The proposed approach shows the highest performance in case of key insertion/deletion and moreover requires only 71%~89% of storage as compared with CB tree.

Compact Binary Tree for Dynamic Operations (동적 연산을 위한 집약 이진(CB) 트리)

  • Kim, Sung Wan
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2014.11a
    • /
    • pp.293-294
    • /
    • 2014
  • 정보 검색 분야에서 키 탐색을 빠르게 하기 위한 인덱스 구조로 이진 트라이가 대표적으로 사용된다. CB 트리는 이진 트라이 구조를 구현할 경우 발생하는 저장 공간의 부담을 축소하기 위해 이진 시퀀스를 사용하여 저장한다. 이는 저장 공간 측면에서 상당한 우수성을 보여주나 키의 잦은 삽입 및 삭제 요구가 있을 경우 이진 비트열에 대한 시프트 연산이 요구되는 부담이 있다. 본 논문에서는 완전 이진 트라이 구조를 사용하여 CB 트리를 표현하는 방법을 제시하였다. 저장 공간의 크기가 증가되기는 하지만 키가 삽입되거나 삭제되어도 이진 비트열에 대한 시프트 연산이 필요하지 않은 장점이 있다.

  • PDF

Reconstitution of CB Trie for the Efficient Hangul Retrieval (효율적인 한글 탐색을 위한 CB 트라이의 재구성)

  • Jung, Kyu-Cheol
    • Convergence Security Journal
    • /
    • v.7 no.4
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes RCB(Reduced Compact Binary) trie to correct faults of CB(Compact Binary) trie. First, in the case of CB trie, 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 nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the 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 CB trie and of many tree links. In the case of RCB trie in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.

  • PDF

A Study on Small-sized Index Structure and Fast Retrieval Method Using The RCB trio (RCB트라이를 이용한 빠른 검색과 소용량 색인 구조에 관한 연구)

  • Jung, Kyu-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.11-19
    • /
    • 2007
  • This paper proposes RCB(Reduced Compact Binary) tie to correct faults of both CB(Compact Binary) tie and HCB(Hierarchical Compact Binary) trie. First, in the case of CB trie, 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 nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the 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 CB trie and of many tree links. In the case of RCB trie in this thesis, the tree-map could be reduced by about 35% by completely cutting down dummy nods and the whole size by half, compared with the HCB trie.

  • PDF

Establishment of WBS·CBS-based Construction Information Classification System for Efficient Construction Cost Analysis and Prediction of High-tech Facilities (하이테크 공장의 효율적 건설 사업비 분석 및 예측을 위한 WBS·CBS 기반 건설정보 분류체계 구축)

  • Choi, Seong Hoon;Kim, Jinchul;Kwon, Soonwook
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.8
    • /
    • pp.356-366
    • /
    • 2021
  • The high-tech industry, a leader in the national economy, has a larger investment cost compared to general buildings, a shorter construction period, and requires continuous investment. Therefore, accurate construction cost prediction and quick decision-making are important factors for efficient cost and process management. Overseas, the construction information classification system has been standardized since 1980 and has been continuously developed, improving construction productivity by systematically collecting and utilizing project life cycle information. At domestic construction sites, attempts have been made to standardize the classification system of construction information, but it is difficult to achieve continuous standardization and systematization due to the absence of a standardization body and differences in cost and process management methods for each construction company. Particular, in the case of the high-tech industry, the standardization and systematization level of the construction information classification system for high-tech facility construction is very low due to problems such as large scale, numerous types of work, complex construction and security. Therefore, the purpose of this study is to construct a construction information classification system suitable for high-tech facility construction through collection, classification, and analysis of related project data constructed in Korea. Based on the WBS (Work Breakdown Structure) and CBS (Cost Breakdown Structure) classified and analyzed through this study, a code system through hierarchical classification was proposed, and the cost model of buildings by linking WBS and CBS was three-dimensionalized and the utilized method was presented. Through this, an information classification system based on inter-relationships can be developed beyond the one-way tree structure, which is a general construction information classification system, and effects such as shortening of construction period and cost reduction will be maximized.