• Title/Summary/Keyword: CR-Tree

Search Result 37, Processing Time 0.028 seconds

The Cr*-Tree Supporting a Circular Property of Objects (객체의 순환 속성을 지원하는 Cr*-트리)

  • Seon, Hwi-Jun;Kim, Hong-Ki
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1077-1088
    • /
    • 2003
  • To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.

KDBcs-Tree : An Efficient Cache Conscious KDB-Tree for Multidimentional Data (KDBcs-트리 : 캐시를 고려한 효율적인 KDB-트리)

  • Yeo, Myung-Ho;Min, Young-Soo;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.34 no.4
    • /
    • pp.328-342
    • /
    • 2007
  • We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

Heavy Metal Concentrations in Tree Ring Layer and Soil and Tree Ring Growth of Roadside Trees in Seoul (서울시 가로수의 연륜층 및 식재주변 토양의 증금속 농도와 연륜 생장)

  • Yoo, Jae-Yun;Son, Yo-Whan
    • Korean Journal of Environmental Agriculture
    • /
    • v.22 no.2
    • /
    • pp.118-123
    • /
    • 2003
  • This study was carried out to examine the heavy metal concentrations in soils under roadside trees and tree ring layers, and to investigate the relationship between heavy metal concentrations and tree ring growth of roadside trees in Seoul. Soil samples at $0{\sim}20\;cm$ depth and tree line were collected from Platanus occidentalis and Ginkgo biloba at nine streets, and pH and heavy Metal concentrations were analyzed. Soil pH ranged from 6.62 to 8.01 and soil heavy metal concentrations under roadside trees were higher (Zn 109.03, Pb 26.49 and Cu 44.98 mg/kg) compared with those of the referred forest soils. Soils at Cheonggye2ga street showed the highest heavy metal concentrations, and seemed to be related to heavy traffic and dense hardware stores. Tree ring width significantly decreased from 1979 through 2000 for both species. There were positive correlations between Cr, Pb and Cu concentrations in soils and tree ring layers for P. occidentalis and Ni for G. biloba. However, there were negative correlations between Cr concentration in tree ring layers and tree ring width for P. occidentalis, and Ni and Cu for G. biloba. Also there were no significant correlations between climatic factors in Seoul and tree ring width.

Measuring Pattern Recognition from Decision Tree and Geometric Data Analysis of Industrial CR Images (산업용 CR영상의 기하학적 데이터 분석과 의사결정나무에 의한 측정 패턴인식)

  • Hwang, Jung-Won;Hwang, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.56-62
    • /
    • 2008
  • This paper proposes the use of decision tree classification for the measuring pattern recognition from industrial Computed Radiography(CR) images used in nondestructive evaluation(NDE) of steel-tubes. It appears that NDE problems are naturally desired to have machine learning techniques identify patterns and their classification. The attributes of decision tree are taken from NDE test procedure. Geometric features, such as radiative angle, gradient and distance, are estimated from the analysis of input image data. These factors are used to make it easy and accurate to classify an input object to one of the pre-specified classes on decision tree. This algerian is to simplify the characterization of NDE results and to facilitate the determination of features. The experimental results verify the usefulness of proposed algorithm.

An Index Structure for Searching Moving Object Trajectories (이동 객체의 궤적 검색을 위한 인덱스 구조)

  • 이계영;권동섭;송병호;이석호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.217-219
    • /
    • 2001
  • 이동 기기의 발달로 이동 객체의 위치 정보에 대한 연구가 진행되고 있다. 그러나 시공간 데이타베이스에서 요구하는 질의를 효과적으로 처리하기 위한 인덱스 구조는 많지 않다. 사용자는 먼저 범위 질의를 던져 이동 객체를 뽑아낸 후 궤적 질의를 던지게 되는데 이것을 결합 질의라 한다. 기존 방법인 TB-tree는 MBR의 겹침이 심해 성능이 저하된다. 본 논문에서는 결합 질의를 효과적으로 처리할 수 있는 CR-tree 인덱스 구조를 제안한다. CR-tree는 R-tree와 연곁노드로 구성된다. R-tree 부분은 MBR의 겹침을 최소화해 범위 질의를 효과적으로 처리하고 연결 노드 부분은 이동 객체별로 궤적의 부분을 차례로 저장해서 궤적 질의를 빠르게 저리한다. 즉 결합 질의시 R-tree를 이용해 범위에 속하는 이동 객체를 검색하고 연결 노드를 이용해 그 객체의 궤적을 찾는다.

  • PDF

CC-GiST: A Generalized Framework for Efficiently Implementing Arbitrary Cache-Conscious Search Trees (CC-GiST: 임의의 캐시 인식 검색 트리를 효율적으로 구현하기 위한 일반화된 프레임워크)

  • Loh, Woong-Kee;Kim, Won-Sik;Han, Wook-Shin
    • The KIPS Transactions:PartD
    • /
    • v.14D no.1 s.111
    • /
    • pp.21-34
    • /
    • 2007
  • According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

Making Cache-Conscious CCMR-trees for Main Memory Indexing (주기억 데이타베이스 인덱싱을 위한 CCMR-트리)

  • 윤석우;김경창
    • Journal of KIISE:Databases
    • /
    • v.30 no.6
    • /
    • pp.651-665
    • /
    • 2003
  • To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

Mass transfer kinetics using two-site interface model for removal of Cr(VI) from aqueous solution with cassava peel and rubber tree bark as adsorbents

  • Vasudevan, M.;Ajithkumar, P.S.;Singh, R.P.;Natarajan, N.
    • Environmental Engineering Research
    • /
    • v.21 no.2
    • /
    • pp.152-163
    • /
    • 2016
  • Present study investigates the potential of cassava peel and rubber tree bark for the removal of Cr (VI) from aqueous solution. Removal efficiency of more than 99% was obtained during the kinetic adsorption experiments with dosage of 3.5 g/L for cassava peel and 8 g/L for rubber tree bark. By comparing popular isotherm models and kinetic models for evaluating the kinetics of mass transfer, it was observed that Redlich-Peterson model and Langmuir model fitted well ($R^2$ > 0.99) resulting in maximum adsorption capacity as 79.37 mg/g and 43.86 mg/g for cassava peel and rubber tree bark respectively. Validation of pseudo-second order model and Elovich model indicated the possibility of chemisorption being the rate limiting step. The multi-linearity in the diffusion model was further addressed using multi-sites models (two-site series interface (TSSI) and two-site parallel interface (TSPI) models). Considering the influence of interface properties on the kinetic nature of sorption, TSSI model resulted in low mass transfer rate (5% for cassava peel and 10% for rubber tree bark) compared to TSPI model. The study highlights the employability of two-site sorption model for simultaneous representation of different stages of kinetic sorption for finding the rate-limiting process, compared to the separate equilibrium and kinetic modeling attempts.

Geochemical Dispersion and Contamination Characteristics of Heavy Metals in Soils and Leaves of Ginkgo biloba in Seoul Area (서울지역 가로수 토양과 은행나무 잎 중의 중금속 원소들의 지구화학적 분산과 오염특성)

  • Choo Mi-Kyung;Kim Kyu-Han;Lee Jin-Soo;Chon Hyo-Taek
    • Economic and Environmental Geology
    • /
    • v.38 no.3 s.172
    • /
    • pp.221-236
    • /
    • 2005
  • In order to investigate the contamination levels and dispersion patterns of heavy metals such as Cd, Co, Cr, Cu, Fe, Mn, Ni, Pb and Zn by urbanization, soils beneath roadside-trees and leaves of Ginkgo biloba were collected from Seoul area during October to November in 2001. All tree leaves were grouped into washed and unwashed ones. The pH of most soil ranges from 6 to 9 indicating a weak acidic and alkaline. The element couples of Cd-Co, Cr-Ni and Zn-Cu-Pb have good correlation in soils, and contamination sources of Cd-Co, Cr-Ni and Zn-Cu-Pb could be similar. High correlation coefficients among Pb, Cu and Zn in G. biloba indicates that these elements show the similar behavior during the metabolism processes. From the results of pollution index calculation for soils, industrialized and heavy traffic area were severly polluted by heavy metals such as Cd, Cu, Pb and Zn. By the discriminant analysis, industrialized and heavy traffic areas are enriched in the order of Ni> Cr> Pb. Cadmium is useful to discriminate between industrialized and heavy traffic areas, Co and Pb are highly enhanced in heavy traffic area.

Heavy Metals in Leaves of Roadside Trees in Daegu City (대구지역 가로수잎의 중금속)

  • 이찬형;윤현숙;박연준;권종대;노기철;장성환
    • Journal of Environmental Science International
    • /
    • v.11 no.12
    • /
    • pp.1189-1193
    • /
    • 2002
  • This study was conducted to determine the contents of heavy metals in leaves of roadside trees according to different growth stages in Daegu city. The orders of heavy metal contents in leaves of roadside tree and soil were Fe>Mn>Zn>Pb>Cu>Cr>Cd and Fe>Mn>Zn>Cu>Pb>Cr>Cd, respectively. The contents of heavy metals in leaves of roadside trees and soil showed an increasing tendency as the levels of traffic volume increased. The contents of heavy metals in loaves on October were higher than those on May. Zelkova serrate and Ginkgo biloba showed high contents of Cr, Cd and Pb.