• Title/Summary/Keyword: Node Split

Search Result 93, Processing Time 0.018 seconds

Finding Frequent Itemsets Over Data Streams in Confined Memory Space (한정된 메모리 공간에서 데이터 스트림의 빈발항목 최적화 방법)

  • Kim, Min-Jung;Shin, Se-Jung;Lee, Won-Suk
    • The KIPS Transactions:PartD
    • /
    • v.15D no.6
    • /
    • pp.741-754
    • /
    • 2008
  • Due to the characteristics of a data stream, it is very important to confine the memory usage of a data mining process regardless of the amount of information generated in the data stream. For this purpose, this paper proposes the Prime pattern tree(PPT) for finding frequent itemsets over data streams with using the confined memory space. Unlike a prefix tree, a node of a PPT can maintain the information necessary to estimate the current supports of several itemsets together. The length of items in a prime pattern can be reduced the total number of nodes and controlled by split_delta $S_{\delta}$. The size and the accuracy of the PPT is determined by $S_{\delta}$. The accuracy is better as the value of $S_{\delta}$ is smaller since the value of $S_{\delta}$ is large, many itemsets are estimated their frequencies. So it is important to consider trade-off between the size of a PPT and the accuracy of the mining result. Based on this characteristic, the size and the accuracy of the PPT can be flexibly controlled by merging or splitting nodes in a mining process. For finding all frequent itemsets over the data stream, this paper proposes a PPT to replace the role of a prefix tree in the estDec method which was proposed as a previous work. It is efficient to optimize the memory usage for finding frequent itemsets over a data stream in confined memory space. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

A $CST^+$ Tree Index Structure for Range Search (범위 검색을 위한 $CST^+$ 트리 인덱스 구조)

  • Lee, Jae-Won;Kang, Dae-Hee;Lee, Sang-Goo
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.17-28
    • /
    • 2008
  • Recently, main memory access is a performance bottleneck for many computer applications. Cache memory is introduced in order to reduce memory access latency. However, it is possible for cache memory to reduce memory access latency, when desired data are located on cache. EST tree is proposed to solve this problem by improving T tree. However, when doing a range search, EST tree has to search unnecessary nodes. Therefore, this paper proposes $CST^+$ tree which has the merit of CST tree and is possible to do a range search by linking data nodes with linked lists. By experiments, we show that $CST^+$ is $4{\sim}10$ times as fast as CST and $CSB^+$. In addition, rebuilding an index Is an essential step for the database recovery from system failure. In this paper, we propose a fast tree index rebuilding algorithm called MaxPL. MaxPL has no node-split overhead and employs a parallelism for reading the data records and inserting the keys into the index. We show that MaxPL is $2{\sim}11$ times as fast as sequential insert and batch insert.

Effects of Granular Silicate on Watermelon (Citrullus lanatus var. lanatus) Growth, Yield, and Characteristics of Soil Under Greenhouse

  • Kim, Young-Sang;Kang, Hyo-Jung;Kim, Tae-Il;Jeong, Taek-Gu;Han, Jong-Woo;Kim, Ik-Jei;Nam, Sang-Young;Kim, Ki-In
    • Korean Journal of Soil Science and Fertilizer
    • /
    • v.48 no.5
    • /
    • pp.456-463
    • /
    • 2015
  • The objective of this study was to determine the effects of granular type of silicate fertilizer on watermelon growth, yield, and characteristics of soil in the greenhouse. Four different levels of silicate fertilizer, 0(control), 600, 1,200, $1,800kg\;ha^{-1}$ were applied for experiment. The silicate fertilizer was applied as a basal fertilization before transplanting watermelon. Compost and basal fertilizers were applied based on the standard fertilizer recommendation rate with soil testing. All of the recommended $P_2O_5$ and 50% of N and $K_2O$ were applied as a basal fertilization. The N and $K_2O$ as additional fertilization was split-applied twice by fertigation method. Watermelon (Citrullus lanatus Thunb.) cultivar was 'Sam-Bok-KKuol and main stem was from rootstock (bottle gourd: Lagenaria leucantha Standl.) 'Bul-Ro-Jang-Sang'. The watermelon was transplanted on April, 15. Soil chemical properties, such as soil pH, EC, available phosphate and exchangeable K, Mg, and available $SiO_2$ levels increased compared to the control, while EC was similar and the concentrations of soil organic matter decreased. Physical properties of soils, such as soil bulk density and porosity were not different among treatments. The growth characteristics of watermelon, such as stem diameter, fresh and dry weight of watermelon at harvest were thicker and heavier for silicate treatment than the control, while number of node was shorter than the control. Merchantable watermelon increased by 3-5% compared to the control and sugar content was 0.4 to $0.7^{\circ}Brix$ higher than the control. These results suggest that silicate fertilizer application in the greenhouse can improve some chemical properties of soils and watermelon stem diameter and dry weight, which are contributed to watermelon quality and marketable watermelon production.