• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.451-462
• /
• 2008

Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The $TPR^*$-tree is most popularly accepted as an index structure for processing future-time queries. In the $TPR^*$-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original $TPR^*$-tree significantly.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.1-15
• /
• 2009

This paper presents an assignment method of the multidimensional type inheritance indexes (MD-TIXs) to support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested element and type inheritance hierarchies. In this paper, we have analyzed the strategy of the query processing by using the MD-TIXs, and presented an assignment method of the MD-TIXs in the framework of complex queries, containing conjunctions of nested predicates, each one involving an Xpath having target types or domain types substitution. We first consider MD-TIX operations caused by updating of XML data-bases, and the use of the MD-TIXs in the case of a query containing a single nested predicate. And then, we consider the assignments of the MD-TIXs in the framework of more general queries containing nested predicates over overlapping paths that have common subpaths.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1161-1168
• /
• 2002

In this paper, the throughput performance of an ARQ scheme is analyzed with noisy feedback channel, in order to exactly analysis for performance of an ARQ scheme. An ARQ mechanism is presented by state diagram, and the throughput of an ARQ scheme is mathematically derived using generation function for a signal flow graph. The channel is modeled by the Nakagami-m fading channel which is distributed over far and wide, and the throughput performance of an ARQ scheme, which is applied in BPSK and BFSK systems, according to feedback gain and fading index m is analyzed through computer simulation. In the results, It is shown conformed that the throughput of an ARQ scheme decreased according to the increase of the noise for feedback channel, but it increased according to the increase of the feedback gain and fading index m. Also, it is shown that the throughput of an ARQ scheme using BPSK system is superior to BFSK system because of the difference of bit error probability between BPSK and BFSK systems.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

• Journal of Korea Water Resources Association
• /
• v.50 no.2
• /
• pp.121-128
• /
• 2017

In this study, robustness index and uncertainty analysis were proposed to quantify the risk inherent in the process of climate change vulnerability assessment. The water supply vulnerability for six metropolitan cities (Busan, Daegu, Incheon, Gwangju, Daejeon, and Ulsan), except for Seoul, were prioritized using TOPSIS, a kind of multi-criteria decision making method. The robustness index was used to analyze the possibility of rank reversal and the uncertainty analysis was introduced to derive the minimum changed weights of the criteria that determine the rank reversal between any paired cities. As a result, Incheon and Daegu were found to be very vulnerable and Daegu and Busan were derived to be very sensitive. Although Daegu was relatively vulnerable against the other cities, it can be largely improved by developing and performing various climate change adaptation measures because it is more sensitive. This study can be used as a preliminary assessment for establishing and planning climate change adaptation measure.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.5
• /
• pp.1-10
• /
• 2002

Efficient processing of expensive queries that include joins and/or aggregate functions is crucial in data warehousing environment since there reside enormous volume of data. In this paper, we propose a new method for processing of queries that have both of joins and aggregate functions. The proposed method first performs grouping of the dimension table and then processes join by using the bitmap join index. This makes only the fact table accessed for processing aggregate functions, and thus resolves the serious performance degradation of the existing method. For showing the superiority of the proposed method, we suggest the cost models for the proposed and existing ones, and perform extensive simulations based on the TPC-H benchmark.

• Journal of the Korean Society for Railway
• /
• v.20 no.4
• /
• pp.448-457
• /
• 2017

In this paper, for high speed railway propulsion systems, a single phase PWM Converter using discontinuous PWM (DPWM) was investigated. The conventional PWM Converter uses a low frequency modulation index of less than 10 to reduce switching losses due to high power characteristics, which results in low control frequency bandwidth and requires an additional compensation method. To solve these problems, the DPWM method, which is commonly used in three phase PWM Inverters, was adopted to a single phase PWM Converter. The proposed method was easily implemented using offset voltage techniques. Method can improve the control performance by doubling the frequency modulation index for the same switching loss, and can also bring the same dynamic characteristics among switches. Proposed DPWM method was verified by simulation of 100 kW PWM converter.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.845-850
• /
• 2009

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.71-82
• /
• 2006

For real-time animation, keyframe animation that consists of translation, rotation, scaling transform nodes is used widely in 3D graphics. This paper presents geometrical watermarking using vertex coordinates in CoordIndex node and interpolator watermarking using keyvalues in PositionInterpolator node for 3D keyframe animation based on VRML. Experimental results verify that the proposed algorithm has the robustness against geometrical attacks and timeline attacks as well as the invisibility.