• Title/Summary/Keyword: KD트리

Search Result 15, Processing Time 0.022 seconds

An Efficient Hybrid Spatial Index Structure based on the R-tree (R-tree 기반의 효율적인 하이브리드 공간 인덱스 구조)

  • Kang, Hong-Koo;Kim, Joung-Joon;Han, Ki-Joon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.771-772
    • /
    • 2009
  • 최근 대표적인 공간 인덱스 구조인 R-tree를 기반으로 KD-tree나 Quad-tree와 같은 공간 분할 특성을 이용하여 인덱싱 성능을 향상시키기 위한 연구가 활발하다. 본 논문에서는 기존에 제시된 R-tree 기반 인덱스 구조인 SQR-tree와 PMR-tree의 특성을 결합하여 대용량 공간 데이타를 보다 효율적으로 처리하는 인덱스 구조인 MSQR-tree(Mapping-based SQR-tree)를 제시한다. SQR-tree는 Quad-tree를 확장한 SQ-tree와 각 SQ-tree 리프 노드마다 실제로 공간 객체를 저장하는 R-tree가 연계되어 있는 인덱스 구조이고, PMR-tree는 R-tree에 R-tree 리프 노드를 직접 접근할 수 있는 매핑 트리를 적용한 인덱스 구조이다. 본 논문에서 제시하는 MSQR-tree는 SQR-tree를 기본 구조로 가지고 R-tree마다 매핑 트리가 적용된 구조를 갖는다. 따라서, MSQR-tree에서는 SQR-tree와 같이 질의가 여러 R-tree에서 분산 처리되고, PMR-tree와 같이 매핑 트리를 통해 R-tree 리프 노드를 빠르게 접근할 수 있다. 마지막으로 성능 실험을 통해 MSQR-tree의 우수성을 입증하였다.

Indexing Moving Objects with Real-Time Updates (실시간 갱신을 통한 이동 객체의 색인 기법)

  • Bok Kyoung-Soo;Seo Dong-Min;Yoo Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.141-152
    • /
    • 2004
  • In this paper, we propose the index structure supporting the future position retrievals with efficiently updating continuous positions of moving objects in location based services. For reducing update costs of moving objects, our index structure directly accesses to the leaf node with moving objects using secondary index structure and performs bottom up update when node information is changed. Positions of moving objects are stored in primary index structure. In primary index structure, the split information similar to kd-tree is stored to internal node for increasing node's fanout. And the proposed index structure supports the future position retrievals using velocity of moving objects in the child node.

  • PDF

Alteration of Biochemical Profiles after High-Dose Intravenous Immunoglobulin Administration in Kawasaki Disease (가와사끼병에서 고용량 정맥용 면역글로불린 투여 후 생화학 지표들의 변화)

  • Lee, Ji-Won;Lee, Kyung-Yil
    • Clinical and Experimental Pediatrics
    • /
    • v.46 no.8
    • /
    • pp.817-820
    • /
    • 2003
  • Purpose : Intravenous immunoglobulin(IVIG) has been used as an immunomodulatory treatment for several immune-mediated diseases. The early effect of high-dose IVIG on biochemical profiles including lipids and proteins was evaluated in patients with Kawasaki disease(KD). Methods : Twelve children with KD(nine boys) were treated with IVIG of 2 g/kg over 12 hours. Serial sera were collected from the patients four times : before IVIG treatment and two hours, 24 hours and seven days after IVIG treatment. The samples were frozen at $-20^{\circ}C$ before biochemical analysis. Results : A significant decrease in albumin concentration was found two hours h and 24 hours after IVIG treatment, but this recovered to the pretreatment level after seven days. Total cholesterol and triglyceride increased slightly after seven day. A significant decrease in HDL-cholesterol and C-reactive protein was seen two hours and 24 hours after IVIG treatment. Conclusion : High-dose IVIG affects immediate changes in protein profiles and HDL-cholesterol in KD. Changes in HDL-cholesterol induced by IVIG may be the result of changes in systemic protein metabolism.

A Study on the Effective Interpolation Methods to the Fluid-Structure Interaction Analysis for Large-Scale Structure (거대 구조물의 유체-구조 연계 해석을 위한 효과적인 보간기법에 대한 연구)

  • Lee, Ki-Du;Lee, Young-Shin;Kim, Dong-Soo;Lee, Dae-Yearl
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.5
    • /
    • pp.433-441
    • /
    • 2009
  • Generally, the events in nature have multi-disciplinary characteristics. To solve this problems, these days loosely coupled methods are widely applied because of advantage of solvers which are already developed and well proved. Those solvers use different mesh system, so transformation and mapping of data are vital in the field of fluid-structure interaction(FSI). In this paper, the interpolation of deformation which is used globally and compactly supported radial basis functions(RBF), and mapping of force which use principle of virtual work are examined for computing time and accuracy to compare ability with simple 3-D problem. As the results, interpolation scheme of compactly supported radial basis functions are useful to interpolation and mapping for large-scale airplane in FSI with a k-dimensional tree(kd-tree) which is a space-partitioning data structure for organizing points in a k-dimensional space.

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.