• 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.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.59-75
• /
• 2006

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1133-1148
• /
• 2012

This paper presents a hierarchical structuring method for the multidimensional type inheritance indices (MD-TIXs) that support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting ancestor-descendant explorations that involve both nested element and type inheritance hierarchies. However, In the case of a long Xpath, the building and maintenance of MD-TIX are very difficult because of index entry construction problem. So, we propose a type inheritance index hierarchy method for solving this difficulty. We first construct base indices that support direct relationship explorations between adjacent two types on a given Xpath, and then, based on these base indices, we construct hierarchically the derived indices that support indirect relationship explorations between any two types of Xpath until constructing one target index for supporting the full Xpath. And we also present an algorithm that efficiently constructs a partial index hierarchy for supporting given a set of sub-pathes explorations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.6
• /
• pp.2245-2254
• /
• 2013

A vulnerability index was developed for drought by using trend analysis and Delphi method. Twelve indicators were selected based on three groups, i.e., hydrological, meteorological, and humanistic groups. Data were collected from Nakdong river watershed. Three trend tests, i.e., Mann-Kendall, Hotelling-Pabst, and Sen's trend tests, were performed for standardizing the indicators and Delphi method was used to estimate the weights for individual indicators. The drought vulnerability index was calculated for seven regions in the Nakdong watershed and Hapcheon turned out to be the most vulnerable region among the study regions. The drought vulnerability index developed in this study can be applied to other regions in Korea for establishing national water resources management plan.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.1
• /
• pp.128-141
• /
• 2010

Drought indices such as SPI(Standard Precipitation Index) and PDSI(Palmer Drought Severity Index) estimated using ground observations are not enough to describe detail spatial distribution of drought condition. In this study, the drought index with improved spatial resolution was estimated by using the CART algorithm and ancillary data such as MODIS NDVI, MODIS LST, land cover, rainfall, average air temperature, SPI, and PDSI data. Estimated drought index using the proposed approach for the year 2008 demonstrates better spatial information than that of traditional approaches. Results show that the availability of satellite imageries and various associated data allows us to get improved spatial drought information using a data mining technique and ancillary data and get better understanding of drought condition and prediction.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.2
• /
• pp.335-351
• /
• 2011

In order to resolve data scarcity problem related to crisis, Oh and Kim (2007) proposed to use stability oriented approach which focuses a base period of financial market, fits asymptotic stationary autoregressive model to the base period and then compares the fitted model with the current market situation. Based on such approach, they developed financial market instability index. However, since neural network, their major tool, depends on the base period too heavily, their instability index tends to suffer from inaccuracy. In this study, we consider linear asymptotic stationary autoregressive model and neural network to fit the base period and produce two instability indexes independently. Then the two indexes are combined into one integrated instability index via newly proposed combining method. It turns out that the combined instability performs reliably well.

• Korean Journal of Remote Sensing
• /
• v.31 no.2
• /
• pp.149-160
• /
• 2015

A comparative study was conducted for alternative consecutive procedures of detection of cloud-contaminated pixels and gap-filling and smoothing of time-series data to produce high-quality gapless satellite vegetation index (i.e. Normalized Difference Vegetation Index, NDVI). Performances of five alternative methods for detecting cloud contaminations were tested with ground-observed cloudiness data. The data gap was filled with a simple linear interpolation and then, it was applied two alternative smoothing methods (i.e. Savitzky-Golay and Wavelet transform). Moderate resolution imaging spectroradiometer (MODIS) data were used in this study. Among the alternative cloud detection methods, a criterion of MODIS Band 3 reflectance over 10% showed best accuracy with an agreement rate of 85%, which was followed by criteria of MODIS Quality assessment (82%) and Band 3 reflectance over 20% (81%), respectively. In smoothing process, the Savitzky-Golay filter was better performed to retain original NDVI patterns than the wavelet transform. This study demonstrated an operational framework of gapdetection, filling, and smoothing to produce high-quality satellite vegetation index.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.7
• /
• pp.3528-3537
• /
• 2013

Evaluation indices of the panelizing optimization for Architectural freeform surfaces are proposed for quantitative evaluation through the case studies on panelizing optimization and evaluation index for Architectural freeform surfaces. Proposed evaluation items are adherence to original design intent, production ease, and continuity. The evaluation index for adherence to original design intent is surfaces fitness, the evaluation indices for production ease are planarity, planar panel ratio, and the evaluation indices for continuity are tangent continuity, and divergence. Algorithms are also suggested to compute the proposed evaluation indices.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.1-10
• /
• 2007

In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.