• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.553-560
• /
• 2003

A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs severe overheads. The prefix-sum cube was proposed for the efficient processing of range-sum queries in OLAP environments. However, the prefix-sum cube has been criticized due to its space requirement. In this paper, we propose a lossless compression method called the overlapped-subcube that is developed for the purpose of compressing prefix-sum cubes. A distinguished feature of the overlapped-subcube is that searches can be done without decompressing. The overlapped-subcube reduces the space requirement for storing prefix-sum cubes, and improves the query performance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.3
• /
• pp.260-272
• /
• 2001

In this paper, we have designed a region-based image retrieval system, FRIP(Finding Region In the Pictures). This system includes a robust image segmentation scheme using color and texture direction and retrieval scheme based on features of each region. For image segmentation, by using a circular filter, we can protect the boundary of round object and merge stripes or spots of objects into body region. It also combines scaled and shifted color coordinate and texture direction. After image segmentation, in order to improve the storage management effectively and reduce the computation time, we extract compact features from each region and store as index. For user interface, by the user specified constraints such as color-care / don't care. scale-care / dont care, shape-care / dont care and location-care / dont care, the overal/ matching score is estimated and the top Ie nearest images are reported in the ascending order of the final score.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.908-922
• /
• 1997

In this paper,we present an dffcient way to describe the commplex meaning embedded in video data for the cintent-based retrival in a video database.Intead of viewing the data stored in a file as continuous bit stream,we associate the desired interval in the stream with a set of atteibute and value pairs which describe its meaning.Since the meaning of video data can be cimplex and can change dyamically. It is necessary to com-bine the fixed schema of attributes used in the traditional database systrm with a description method through a set of attribute and value pairs that can be defined dynamically.As the cintent of viedo data can be expressed differently according to the view point of a user,it is important ot maintain the meaning of the attribute and value pairs cinsistently for different users.This paper proposes the dffctive way to manage the set of attri-bute and value pairs.In addition,it also describes a way to define a new video presentation by separating a video stream phsycally or by sharing the portion of a bit stream,and the new method can minimize the required storage space.

• Spatial Information Research
• /
• v.4 no.1
• /
• pp.1-11
• /
• 1996

DRASTIC system developed by U.S.EPA, is widely used for assessing groundwater pollution potential The system can be applied to site selection of well or waste disposal, Ianduse planning for groundwater protection, and monitoring. In this study, GIS(Geographic Information System) was established hydrogeological database of DRASTIC system and cartographic modeling to asre:; regional groundwater pollution potential around Chungju Lake. Hydrogeological factors of the system were depth to water, net recharge, aquifer media, soil media, slope and hydraulic conductivity. Risk of groundwater pollution to non -point source pollution, was also analyzed by incorporation of actual pollution sources(N, P) and DRASTIC system. The GIS data could be very quickly analysed hydrogeological characteristics of the study area by graphic user interface programs devel¬oped with AML(ARC Macro Language) of ARC/INFO.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.79-88
• /
• 2002

Data on the Internet are usually represented and transfered as XML. the XML data is represented as a tree and therefore, object repositories are well-suited to store and query them due to their modeling power. XML queries are represented as regular path expressions and evaluated by traversing each object of the tree in object repositories. Several indexes are proposed to fast evaluate regular path expressions. However, in some cases they may not cover all possible paths because they require a great amount of disk space. In order to efficiently evaluate the queries in such cases, we propose an optimized traversing which combines the signature method and block traversing. The signature approach shrink the search space by using the signature information attached to each object, which hints the existence of a certain label in the sub-tree. The block traversing reduces disk I/O by early evaluating the reachable objects in a page. We conducted diverse experiments to show that the hybrid approach achieves a better performance than the other naive ones.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

The trajectory of a tag in RFID system is represented as a interval that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. Whole trajectories of a tag are represented as a set of unconnected interval because the location of the tag which left the vicinity of a reader is unknown until it enters the vicinity of another reader. The problems are that trajectories of a tag are not connected. It takes a long time to find trajectories of a tag because it leads to searching the whole index. To solve this problem, we propose a technique that links two intervals of the tag and an index scheme called SLR-tree. We also propose a sharing technique of link information between two intervals which enhances space utilization of nodes, and propose a split policy that preserves shared-link information. And finally, we evaluate the performance of the proposed index and prove that the index processes history queries efficiently.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.117-134
• /
• 1994

The problems of urban land use are becoming worse by the increase of population and facilities. Land use planning is the major part of comprehensive city plan¬ning. Understanding and forecasting the present and future conditions of land use are the main process of land use planning. In order to comprehend the various phenomena which occured on the land, collecting accurate land information is the most important thing for the effective management of land use. Therefore, it is necessary for us to establish the land information systems. In this study, theories of functions, objectives, components and applications of land information systems were investigated as the basis of this research. Case studies of Korea and Japan were examined, not only for the desirable selection of input data items, but also for the effective land use anslysis in land information systems. Through this kind of study, we can anslize and understand the changing patterns of land use over time, and we can also prepare a more desirable and adjustable land use plan-ning programs for the future.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.189-196
• /
• 1994

Adaptive smoothing filter is a filter that averages out the intensities around the pixels of similar intensities while conserving the discontinuties. When human eyes rec-ognize a map, the brain can easily assign one color for each element such as road or building while computer distinguishes all the minute color differences even for one ele¬ment. We can approach to the solution by using the adaptive smoothing filter so that the machine can assign one color for each element as much as we want, and it is found to be a very essential tool foor map segmentation of urban areas. The filter is applied to a scanned map, and it is used to extract roads and residential areas.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.125-133
• /
• 2003

In this paper we propose an efficient content-based image retrieval method using the color and wavelet based texture features. The color features are obtained from soft-color histograms of the global image and the wavelet-based texture features are obtained from the invariant moments of the high-pass sub-band through the spatial-frequency analysis of the wavelet transform. The proposed system, called a color and texture based two-step retrieval(CTBTR), is composed of two-step query operations for an efficient image retrieval. In the first-step matching operation, the color histogram features are used to filter out the dissimilar images quickly from a large image database. The second-step matching operation applies the wavelet based texture features to the retained set of images to retrieve all relevant images successfully. The experimental results show that the proposed algorithm yields more improved retrieval accuracy with computationally efficiency than the previous methods.