• Title, Summary, Keyword: hybrid tree

Search Result 218, Processing Time 0.049 seconds

Design and Performance Analysis of Signature-Based Hybrid Spill-Tree for Indexing High Dimensional Vector Data (고차원 벡터 데이터 색인을 위한 시그니쳐-기반 Hybrid Spill-Tree의 설계 및 성능평가)

  • Lee, Hyun-Jo;Hong, Seung-Tae;Na, So-Ra;Jang, You-Jin;Chang, Jae-Woo;Shim, Choon-Bo
    • Journal of Internet Computing and Services
    • /
    • v.10 no.6
    • /
    • pp.173-189
    • /
    • 2009
  • Recently, video data has attracted many interest. That is the reason why efficient indexing schemes are required to support the content-based retrieval of video data. But most indexing schemes are not suitable for indexing a high-dimensional data except Hybrid Spill-Tree. In this paper, we propose an efficient high-dimensional indexing scheme to support the content-based retrieval of video data. For this, we extend Hybrid Spill-Tree by using a newly designed clustering technique and by adopting a signature method. Finally, we show that proposed signature-based high dimensional indexing scheme achieves better retrieval performance than existing M-Tree and Hybrid Spill-Tree.

  • PDF

A Hybrid Approach to Arbitrate Tag Collisions in RFID systems (RFID 시스템에서 태그 충돌 중재를 위한 하이브리드 기법)

  • Ryu, Ji-Ho;Lee, Ho-Jin;Seok, Yong-Ho;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.483-492
    • /
    • 2007
  • In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

SQR-Tree : A Hybrid Index Structure for Efficient Spatial Query Processing (SQR-Tree : 효율적인 공간 질의 처리를 위한 하이브리드 인덱스 구조)

  • Kang, Hong-Koo;Shin, In-Su;Kim, Joung-Joon;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.47-56
    • /
    • 2011
  • Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.

Embedded Node Cache Management for Hybrid Storage Systems (하이브리드 저장 시스템을 위한 내장형 노드 캐시 관리)

  • Byun, Si-Woo;Hur, Moon-Haeng;Roh, Chang-Bae
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.157-159
    • /
    • 2007
  • The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

  • PDF

SQMR-tree: An Efficient Hybrid Index Structure for Large Spatial Data (SQMR-tree: 대용량 공간 데이타를 위한 효율적인 하이브리드 인덱스 구조)

  • Shin, In-Su;Kim, Joung-Joon;Kang, Hong-Koo;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.4
    • /
    • pp.45-54
    • /
    • 2011
  • In this paper, we propose a hybrid index structure, called the SQMR-tree(Spatial Quad MR-tree) that can process spatial data efficiently by combining advantages of the MR-tree and the SQR-tree. The MR-tree is an extended R-tree using a mapping tree to access directly to leaf nodes of the R-tree and the SQR-tree is a combination of the SQ-tree(Spatial Quad-tree) which is an extended Quad-tree to process spatial objects with non-zero area and the R-tree which actually stores spatial objects and are associated with each leaf node of the SQ-tree. The SQMR-tree consists of the SQR-tree as the base structure and the mapping trees associated with each R-tree of the SQR-tree. Therefore, because spatial objects are distributedly inserted into several R-trees and only R-trees intersected with the query area are accessed to process spatial queries like the SQR-tree, the query processing cost of the SQMR-tree can be reduced. Moreover, the search performance of the SQMR-tree is improved by using the mapping trees to access directly to leaf nodes of the R-tree without tree traversal like the MR-tree. Finally, we proved superiority of the SQMR-tree through experiments.

A Nodes Set Based Hybrid Evolutionary Strategy on the Rectilinear Steiner Tree Problem (점집합을 개체로 이용한 직각거리 스타이너 나무 문제의 하이브리드 진화 전략에 관한 연구)

  • Yang Byoung-Hak
    • Korean Management Science Review
    • /
    • v.23 no.1
    • /
    • pp.75-85
    • /
    • 2006
  • The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree(MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolutionary strategy on RSTP based upon nodes set is presented. The computational results show that the hybrid evolutionary strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolutionary strategy is about 11.14%, which is almost similar to that of optimal solutions.

Intelligent Fault Diagnosis System Using Hybrid Data Mining (하이브리드 데이터마이닝을 이용한 지능형 이상 진단 시스템)

  • Baek, Jun-Geol;Heo, Jun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.960-968
    • /
    • 2005
  • The high cost in maintaining complex manufacturing process makes it necessary to enhance an efficient maintenance system. For the effective maintenance of manufacturing process, precise fault diagnosis should be performed and an appropriate maintenance action should be executed. This paper suggests an intelligent fault diagnosis system using hybrid data mining. In this system, the rules for the fault diagnosis are generated by hybrid decision tree/genetic algorithm and the most effective maintenance action is selected by decision network and AHP. To verify the proposed intelligent fault diagnosis system, we compared the accuracy of the hybrid decision tree/genetic algorithm with one of the general decision tree learning algorithm(C4.5) by data collected from a coil-spring manufacturing process.

  • PDF

A Hybrid Hyper Query Tree Algorithm for RFID System (RFID 시스템을 위한 하이브리드 하이퍼 쿼리 트리 알고리즘)

  • Kim, Tae-Hee;Lee, Seong-Joon;Ahn, Kwang-Seon
    • The KIPS Transactions:PartA
    • /
    • v.15A no.5
    • /
    • pp.287-294
    • /
    • 2008
  • A tag collision arbitration algorithm for RFID passive tags is one of the important issues for fast tag identification, since reader and tag have a shared wireless channel in RFID system. This paper suggests Hyper-Hybrid Query Tree algorithm to prevent the tag-collisions. The suggested algorithms determine the specified point in time for tag to transfer ID to reader by using value 1 of the upper 3 bit based on Query Tree. Also, because the transferred upper 3 bits of tag is different depending on the time of transfer, it is possible to predict in the suggested Algorithm. In the performance evaluation through simulation, it shows the suggested algorithm has higher performance in the number of queries compared to other Tree-based protocols.

Selection of Cultivars with Vigorous Growth Habit for Street Tree, Dwarf Tree Form for Pot Plants, and Spreading Branches for Groundcovers in the Recently Developed Cultivars of Rose of Sharon (Hibiscus spp.) for Landscape Uses (나라꽃 무궁화 품종중 가로수용, 분화용 및 지피용으로 조경적 활용도가 높은 품종 선정)

  • Kang, Ho-Chul;Kim, Dong-Yeob;Ha, Yoo-Mi
    • Journal of the Korean Institute of Traditional Landscape Architecture
    • /
    • v.34 no.2
    • /
    • pp.87-99
    • /
    • 2016
  • This study was carried out to characterize 127 recently developed cultivars of Rose of Sharon (Hibiscus spp.) in Korea and foreign Countries for landscape uses. The examined factors were growth characteristics such as tree height of a 1-year grafted plant(cm), plant type, growth habit, leaf characteristics such as shape and size, flower characteristics such as color, shape, size, and red eye during 2014 and 2015 for landscape uses. The results are obtained as follows; Hibiscus hybrid 'Daewangchun', 'Daeil', 'Lohengrin', 'Yeonam', 'Joomong', 'Jina', and H. syriacus 'Honggarosu' had vigorous shoot growth and tall tree size of 100cm. New Hibiscus cultivars, Hibiscus hybrid 'Daewangchun' and 'Daeil', having vigorous growth, uniform plant habit, upright, and compact branches were developed through interspecific crosses between H. syriacus 'Samchully' (♀) and H. sinosyriacus 'Seobong' (♂). This newly developed cultivar 'Daewangchun', 'Daeil', 'Lohengrin', 'Yeonam', 'Joomong', 'Jina', and H. syriacus 'Honggarosu' having tall vigorous growth d unique flower with long red eye can be used as street tree or specimen plant in landscape. Otherwise, H. syriacus 'Tamla', 'Melrose', 'Bidan', 'Hi Lea', 'Byeollee', 'Byunghwa', 'Mibak', 'Hanyang', 'Chungam', 'Lil Kim Violet', 'Jongmoo', 'Eunhasu', Hibiscus hybrid 'Saehanseo', and Hibiscus hybrid 'Yousoon' were selected as small tree of 30~39cm. They had dwarf form in tree seemed to be suitable for pot or flower bed planting on both indoor and outdoor conditions. H. syriacus 'Antong', 'Chungjo', and 'Lil Kim' were less than 30 cm of tree size. H. syriacus 'Antong', 'Chungjo', and 'Lil Kim', characterized by its compact, upright and outwardly spreading plant habit; freely branching habit; dark green-colored leaves; good garden performance. Therefore, the new cultivars with tall and small tree size were a promising cultivar as a ground covers or pot planting as woody landscape plant.

Inter-Process Correlation Model based Hybrid Framework for Fault Diagnosis in Wireless Sensor Networks

  • Zafar, Amna;Akbar, Ali Hammad;Akram, Beenish Ayesha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.536-564
    • /
    • 2019
  • Soft faults are inherent in wireless sensor networks (WSNs) due to external and internal errors. The failure of processes in a protocol stack are caused by errors on various layers. In this work, impact of errors and channel misbehavior on process execution is investigated to provide an error classification mechanism. Considering implementation of WSN protocol stack, inter-process correlations of stacked and peer layer processes are modeled. The proposed model is realized through local and global decision trees for fault diagnosis. A hybrid framework is proposed to implement local decision tree on sensor nodes and global decision tree on diagnostic cluster head. Local decision tree is employed to diagnose critical failures due to errors in stacked processes at node level. Global decision tree, diagnoses critical failures due to errors in peer layer processes at network level. The proposed model has been analyzed using fault tree analysis. The framework implementation has been done in Castalia. Simulation results validate the inter-process correlation model-based fault diagnosis. The hybrid framework distributes processing load on sensor nodes and diagnostic cluster head in a decentralized way, reducing communication overhead.