• Title/Summary/Keyword: Compact Binary Tree

Search Result 11, Processing Time 0.028 seconds

Enhancing Retrieval Performance for Hierarchical Compact Binary Tree (계층형 집약 이진 트리의 검색 성능 개선)

  • Kim, Sung Wan
    • Journal of Creative Information Culture
    • /
    • v.5 no.3
    • /
    • pp.345-353
    • /
    • 2019
  • Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

Compact Complementary Quadtree for Binary Images (이진 영상을 위한 Compact Complementary Quadtree의 구성)

  • Jo, Yeong-U;Kim, Yeong-Mo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.209-214
    • /
    • 1997
  • In this paper, we propose a new preorder tree method for binary images, named the Compact Complementary Quadtree (CCQ). In the proposed method we use type codes for representing nodes in the quadtree instead of using the symbols G, B, and W. From the experimental results, we have confirmed that the CCQ has a higher compression ratio than of the DF-expression. CCQ can be effectively applied to progressive transmission of binary images such as line drawings, geographical maps, and halftones.

  • PDF

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.

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

Reconstitution of Compact Binary trie for the Efficient Retrieval of Hangul UniCODE Text (한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성)

  • Jung, Kyu Cheol;Lee, Jong Chan;Park, Sang Joon;Kim, Byung Gi
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.21-28
    • /
    • 2009
  • 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.

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 the Implementation of Small Capacity Dictionary for Mobile Equipments Using a CBDS tree (CBDS 트리를 이용한 모바일 기기용 저용량 사전 구현에 관한 연구)

  • Jung Kyu-Cheol;Lee Jin-Hwan;Jang Hye-Suk;Park Ki-hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.33-40
    • /
    • 2005
  • Recently So far Many low-cost mobile machinery have been produced. Those are being used for study and business. But those are some weak Points which are small-capacity storage and quite low-speed system. If we use general database programs or key-searching algorithm, It could decrease in performance of system. To solve those Problems, we applied CBDS(Compact Binary Digital Search) trie to mobile environment. As a result we could accomplish our goal which are quick searching and low-capacity indexing. We compared with some Java classes such as TreeSet to evaluation. As a result, the velocity of searching was a little slow than B-tree based TreeSet. But the storage space have been decreased by 29 percent. So I think that it would be practical use.

  • PDF

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

BF Gray Quadtree : Efficient Image Representation Method (Breadth First Gray Quadtree:화상의 효율적 표현법)

  • Lee, Geuk;Lee, Min-Gyu;Hwang, Hee-Yeung;Lee, Jung-Won
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.5
    • /
    • pp.494-499
    • /
    • 1990
  • A new compact hierarchical representation method image is proposed. This method represents a binary image with the set of decimal numbers. Each decimal number represents the pattern of nonterminal node(gray node) in the quadtree. This pattern implies the combination of its four child nodes. The total number of gray nodes is one third of that terminal nodes. We show that gray tree method is efficient comparing with others which have been studied.

  • PDF

Mutual Information Analysis for Three-Phase Dynamic Current Mode Logic against Side-Channel Attack

  • Kim, Hyunmin;Han, Dong-Guk;Hong, Seokhie
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.584-594
    • /
    • 2015
  • To date, many different kinds of logic styles for hardware countermeasures have been developed; for example, SABL, TDPL, and DyCML. Current mode-based logic styles are useful as they consume less power compared to voltage mode-based logic styles such as SABL and TDPL. Although we developed TPDyCML in 2012 and presented it at the WISA 2012 conference, we have further optimized it in this paper using a binary decision diagram algorithm and confirmed its properties through a practical implementation of the AES S-box. In this paper, we will explain the outcome of HSPICE simulations, which included correlation power attacks, on AES S-boxes configured using a compact NMOS tree constructed from either SABL, CMOS, TDPL, DyCML, or TPDyCML. In addition, to compare the performance of each logic style in greater detail, we will carry out a mutual information analysis (MIA). Our results confirm that our logic style has good properties as a hardware countermeasure and 15% less information leakage than those secure logic styles used in our MIA.