• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.225-236
• /
• 2011

Various applications of LBS (Location Based Services) are being developed to provide the customized service depending on user's location with progress of wireless communication technology and miniaturization of personalized device. To effectively process an amount of vehicles' location data, LBS requires the techniques such as vehicle observation, data communication, data insertion and search, and user query processing. In this paper, we propose the historical location index, GIP-FB (Group Insertion tree with Flexible Buffer Node) and the flexible buffer node technique to adjust the cost of data insertion and search. the designed GIP+ based index employs the buffer node and the projection storage to cut the cost of insertion and search. Besides, it adjusts the cost of insertion and search by changing the number of line segments of the buffer node with user defined time interval. In the experiment, the buffer node size influences the performance of GIP-FB by changing the number of non-leaf node of the index. the proposed flexible buffer node is used to adjust the performance of the historical location index depending on the applications of LBS.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.719-726
• /
• 2007

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.275-282
• /
• 2015

Since a NAND-flash memory is able to keep data during electricity-off and has small cost to store data per bytes, it is widely used on hand-held devices. It is necessary to use an index in order to process mass data effectively on the flash memory. However, since the flash memory requires high cost for a write operation and does not support an overwrite operation, it is possible to reduce the performance of the index when the disk based index is exploited. In this paper, we implement the fixed grid file index and evaluate the performance of the index on various conditions. To do this, we measure the average processing time by the ratio of query operations and update operations. We also the compare the processing times of the flash memory with those of the magnetic disk.

• Land and Housing Review
• /
• v.10 no.4
• /
• pp.41-50
• /
• 2019

This study was started to study the buffer zone of Daejeon metropolitan city in order to study the policy and environment for the suitability evaluation of the use of green buffer zone. The target of the study was selected as the buffer zone of western buffer, which is frequently used in the Daejeon Metropolitan City, and a preliminary index was selected to evaluate the suitability of the green buffer zone. AHP analysis was conducted to increase the reliability of the preliminary indicators and the weight was analyzed by questionnaires to experts and practitioners. In addition, based on the existing statistical data, we rebuilt the green buffer zone and investigated the current condition, and compared and analyzed the green buffer zone and the places where they did not. The results are as follow. First, unlike the statute interpretation that construction can not be done in buffered green spaces, green buffer zones have been utilized in various ways. However, the lack of advanced citizen consciousness of the residents, the responsibility of the responsible person, and the problem of the management office alone are causing problems. Second, according to the results of AHP questionnaire analysis, functional and stability among the appropriateness indexes of green buffer zone utilization were evaluated highly. Park accessibility and utilization potential also weighed somewhat, and it was judged that the epochal trend was more important in the use of green buffer zones. Third, analysis of the status of Western green buffer zones in Daejeon showed that the utilization rate was more than half. This suggests the necessity of judging the appropriateness of the application of the green buffer zone effectively due to the change of the perception of the green buffer zone of the residents. Fourth, as a result of comparing and analyzing the site where the site is used and the site where it is not, it is found that it is used within a range that does not greatly affect each index. However, as the stability has decreased, we have decided that the utilization method is most damaging to the green zone, and we should strive to improve the stability in future. Finally, the analysis of a red clay road and a red clay road sites decreased from Class I of stability to Grade II. However, the fall figure showed a difference between the 13 % drop rate of the target location and the 5% decline rate of utilization. The difference was analyzed as the difference of width of a red clay road. This can be regarded as one of the ways of damaging the green zone to the minimum extent, which is a great advantage in selecting the future utilization plan.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.7
• /
• pp.923-929
• /
• 2021

TCP communication and packet communication require transmission control technology to ensure high quality and high reliability. However, in the case of real-time data transmission, an inefficient transmission problem occurs. In order to overcome this problem and transmit the packet reliability, in general, early congestion control using the buffer level as an index was used. Control of the congestion control point and the cancellation point is delayed because the point at which congestion is controlled is based on the buffer level. Therefore, in this paper, not only the buffer level indicator, but also the ideal buffer level, which determines the packet discard probability, is classified so that the transmission rate and buffer level that measure network congestion are close to the level above the optimal setting. As a result, it was shown that the average buffer level can be directly controlled by maintaining the average buffer level by the ideal buffer level set in the experiment to prove the proposed method.

• Journal of the Korean Ceramic Society
• /
• v.42 no.3 s.274
• /
• pp.178-181
• /
• 2005

Silicon oxynitride (SiON) layers deposited upon a $SiO_2/Si$ buffer layer placed upon silicon wafers have been obtained by using PECVD from $SiH_4,\;N_2O$, and $N_2$. It can be seen that the refractive index, measured by using a prism coupler, for the SiON films can be varied between 1.4480 and 1.4958 at a wavelength of 1552 nm by changing the process parameters. Optical planar waveguides with a thickness of $6{\mu}m$ and a refractive index contrast ($\Delta$n) of $0.36\% have been deposited. Also, etching experiments were performed using ICP dry etching equipment on thick SiON films grown onto Si substrates covered by a thick $SiO_2$ buffer layer. A polarization maintaining single-mode fiber was used for the input and a microscope objective for the output at $1.55{\mu}m$. As a result, a low index contrast SiON based waveguide is fabricated with easily adjustable refractive index of core layer. It illustrates that the output intensity mode is a waveguiding single-mode.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2009

Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1216-1222
• /
• 2016

The advent of large-scale web services has resulted in gradual increase in the amount of data used in those services. These big data are managed efficiently by DBMS such as MySQL and MariaDB, which use InnoDB engine as their storage engine, since InnoDB guarantees ACID and is suitable for handling large-scale data. To improve I/O performance, InnoDB caches data and index of its database through a buffer pool. It also supports multiple buffer pools to mitigate lock contentions. However, the multiple buffer pool scheme leads to the additional data consistency overhead. In this paper, we analyze the overhead of the multiple buffer pool scheme. In our experimental results, although multiple buffer pool scheme mitigates the lock contention by up to 46.3%, throughput of DMBS is significantly degraded by up to 50.6% due to increased disk I/O and fsync calls.

• Korean Journal of Environment and Ecology
• /
• v.24 no.2
• /
• pp.157-165
• /
• 2010

This study was carried out to suggest the basic data of planting method for construction of buffer green space based on the land use in case of reclaimed land by analyzing land structure, planting concept, and planting structure in buffer green space, Rokko Island, Kobe, Japan. Rokko Island(total area: 580ha) is divided into port and logistics industry area and urban area by constructing the box type large-scale buffer green space. The land structure of buffer green space were biased mounding type, parallel mounding type, and complex mounding type. The width of buffer green space was 50meters in case of northern area, from 28 to 32meters in case of eastern area, and 37.5meters in case of western area, and the slope of that was from 18 to 25 degrees and the height of that was from 2 to 15meters. There were applied landscape and buffer planting concept on the sea side area of northern buffer green space, on the other hand landscape and shade planting concept on the Inner city side area of that. According to the result of planting structure analysis of northern buffer green space, the main woody species were those of deciduous-evergreen species grow in warm-temperate forest zone such as Quercus glauca, Cinnamomum camphora, Machilus thunbergii, Elaeagnus maritima. The results of maximum number of species and planting density by $100mm^2$ was that 9 species 22 individuals in canopy layer, 9 species 15 individuals in understory layer, 3 species 67 individuals in shrub layer, and 14 species 104 individuals in total. The plant coverage of northern buffer green space based on the ecological planting method was from 69 to 139% in case of canopy layer, from 26 to 38% in case of understory layer, from 6 to 7% in case of shrub layer, and from 101 to 184% in total. Index of plant crown volume of northern buffer green space based on the ecological planting method was from 1.40 to $3.12m^3/m^2$ in case of canopy layer, from 0.43 to $0.55m^3/m^2$ in case of understory layer, $0.06m^3/m^2$ in case of shrub layer, and from 1.89 to $3.73m^3/m^2$ in total.