• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.673-676
• /
• 2004

To manage and query moving objects efficiently in MMDBMS, a memory index structure should be used. The most popular index structure for storing trajectories of moving objects is 3DR-tree. The 3DR-tree also can be used for MMDBMS. However, the volume of data can exceed the capacity of physical memory since moving objects report their locations continuously. To accommodate new location reports, old trajectories should be migrated to disk or purged from memory. This paper focuses on migration policies of a main memory index structure. Migration policies consist of two steps: (i) node selection, (ii) node placement. The first step (node selection) selects nodes that should be migrated to disk. The criteria of selection are the performance of insertion or query. The second step (node placement) determines the order of nodes written to disk. This step can be thought as dynamic declustering policies.

• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.75-86
• /
• 2003

In main-memory resident index structures, secondary cache misses considerably have an effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However they still suffer from full secondary cache misses whenever visiting each level of a index tree, In this paper, we propose a new index structure that eliminates cache misses even when visiting each level of index tree. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-tree that uses the concepts of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly, Also, we show the superiority of our algorithm through various performance evaluation.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.384-394
• /
• 2004

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.10
• /
• pp.138-148
• /
• 1995

While Model-based Monitoring systems based on state observer theory have shown much promise in the laboratory, they have not been widely accepted by industry because, inpractice, these systems often have poor performance with respect to accuracy, band-width, reliability(false alarms), and robustness. In this paper, the linitations of the deterministic discrete-time state observer are investigated quantitatively from the machine monitoring viewpoint. The limitations in the transient and steady-state observer performance are quantified as estimation error bounds from which performance indices are selected. Each index represents the conditioning of the corresponding performance. By utilizing matrix norm theory, an unified main index is determined, that dominates all the indices. This index could from the basis for an observer design methodology that should improve the performance of model-based monitoring systems.

• Journal of The Korean Astronomical Society
• /
• v.55 no.2
• /
• pp.59-66
• /
• 2022

Stellar magnetic activity is important for formulating the evolution of the star. To represent the stellar magnetic activity, the S index is defined using the Ca II H+K flux measure from the Mount Wilson Observatory. Mg II lines are generated in a manner similar to the formation of Ca II lines, which are more sensitive to weak chromospheric activity. Mg II flux data are available from the International Ultraviolet Explorer (IUE). Thus, the main purpose of this study was to analyze the magnetic activity of stars. We used 343 high-resolution IUE spectra of 14 main-sequence G stars to obtain the Mg II continuum surface flux and Mg II line-core flux around 2,800 Å. We calculated S index using the IUE spectra and compared it with the conventional Mount Wilson S index. We found a color (B - V ) dependent association between the S index and the Mg II emission line-core flux. Furthermore, we attempted to obtain the magnetic activity cycles of these stars based on the new S index. Unfortunately, this was not successful because the IUE observation interval of approximately 17 years is too short to estimate the magnetic activity cycles of G-type stars, whose cycles may be longer than the 11 year mean activity cycle of the sun.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.543-552
• /
• 2005

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• Journal of Digital Convergence
• /
• v.19 no.4
• /
• pp.19-24
• /
• 2021

In this paper, an index of women's safety facilities was created and visualized using public data related to Seoul. CPTED, the women's safety facilities index was created by collecting and analyzing eight data related to the local women's safety index and five major crime victims of women. As a result of the correlation analysis between the factors of the female safety facility index and the number of female crime victims, three data were selected as the main factors, "CCTV," "street lamps," and "female security guardians", which were found to be meaningful at the 95% level of reliability. The distinction women's safety facility index was calculated by weighting the correlation coefficient between the main factors for calculating the women's safety facility index, and visualized using Python's Follium library.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.661-674
• /
• 2000

The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss theexperiences obtained in developing the index manager of the Tachyon, a next-generation MMDBMS. The indexmanager is an essential sub-component of the DBMS used to speed up the retrieval of objects from a largevolume of a database in response to a certain search condition. Previous research efforts on indexing proposed various index structures. However, they hardly dealt with the practical issues occured in implementating an index manager on a target DBMS. In this paper, we touch these issues and present our experiences in developing the index manager on the Tachyon as solutions. The main issues touched are (1) compact representation of an indexentry, (2) support of variable-length keys, (3) support of multiple-attribute keys, (4) support of duplicated keys,(5) definition of external APls, (6) concurrency control, and (7) backup and recovery. We believe that ourcontribution would help MMDBMS developers highly reduce their trial-and-errors.

• The Journal of Asian Finance, Economics and Business
• /
• v.9 no.1
• /
• pp.93-103
• /
• 2022

The main purpose of this study was to gauge the patient satisfaction index and subsequently discuss the Importance-Performance (IP) matrix analysis of the inpatient services in the context of the private hospital setting. The Malaysian Customer Satisfaction Index Model was employed as the theoretical framework for the above purposes. This study involving 242 patients in Malaysian's private healthcare sector used a Web-based survey as the main method of data collection. Partial least square structural equation modeling (PLS-SEM) was utilized for data analysis. Using Fornell et al. (1996)'s formula, the resulting patient satisfaction index was slightly lower than the "very satisfied" category, the target level required for positioning as one of the world's premier medical tourism players. The IP matrix showed that medical quality is the main competitive advantage of the private hospitals that can propel their growth in the global healthcare marketplace. The results also indicate that outcome quality, patient rights, and privacy, and service quality are the three quality domains that need to be prioritized for further improvement. On the other hand, the servicescape quality domain needs to be strategized as the unique selling proposition as the performance of the private hospitals in this regard is already extremely good.