• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.369-373
• /
• 2007

RFID systems large volume of data, it can lead to slower queries. To achieve better query performance, we can partition into active and some nonactive data. In this paper, we propose two approaches of partitioning for efficient query support. The one is average period plus delta partition and the other is adaptive average period partition. We also present the system architecture to manage active data and non-active data and logical database schema. The data manager check the active partition and move all objects from the active store to an archive store associated with an average period plus data and an adaptive average period. Our experiments show the performance of our partitioning methods.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.512-519
• /
• 2002

In this paper, we implemented a loom component to be placed in a window and a looms management system which is able to connect database and to process various queries. The implemented system has aggregate query p개cessing functions for the loom components existing in the selected area by the mouse and it also has high level query processing functions represented with chart and pivot table; it can be used as a decision support system. The proposed system can detect temporal or persistent problems of the looms. Therefore it can be used to raise the productivity and to reduce the cost in textile companies by coping with the situation properly.

• 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 Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1525-1530
• /
• 2011

Techniques for processing continuous queries are required to developing the various types of application services (monitoring services) in ubiquitous environment where the real-time data acquisition from a lot of sensors, analysis, and processing are required. In the previous works of the continuous queries, they have represented all of the continuous queries as the interval queries or region queries, and proposed some methods for processing theses queries. The types of continuous queries, however, are very various, and could be presented by combining the attribute conditions, spatial conditions, and temporal conditions. In this paper, I have classify the types of continuous queries, and have proposed the continuous query model which could be presented by combining those conditions. The contributions of this paper include that it proposes the query model representing the continuous queries and suggests future research directions.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.1
• /
• pp.37-47
• /
• 2003

In this paper, a component was designed for a loom in a window, and then a user interface was implemented to be able to connect database and to process various queries. The implemented system has aggregate query processing functions for the loom components existing in the selected area by the mouse and it also supports high level query processing functions represented with chart and pivot table; we can use it as a decision support system. The proposed system can detect temporal or persistent problems in the looms. Therefore, it can be used to raise the productivity and to reduce the cost in textile companies by coping with the situation properly.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.725-727
• /
• 2006

The development of GIS and Location-Based Services requires a high-level database that will be able to allow real-time access to moving objects for spatial and temporal operations. MODB.MM is able to meet these requirements quite adequately, providing operations with the abilities of acquiring, storing, and querying large-scale moving objects. It enables a dynamic and diverse query mechanism, including searches by region, trajectory, and temporal location of a large number of moving objects that may change their locations with time variation. Furthermore, MODB.MM is designed to allow for performance upon main memory and the system supports the migration on out-of-date data from main memory to disk. We define the particular query for truncation of moving objects data and design two migration methods so as to operate the main memory moving objects database system and file-based location storage system with.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.36-40
• /
• 2008

SIMS manages data for various spatial and non-spatial as integral management system to support space information administration environment and support several application works. Without being limited to spatial data that existent spatial Data Mining question language advances handling in this paper, did so that can find useful information from various data connected with automatically data collection, artificial satellite side upside service, remote sensing, GPS. Mobile Computing and data about Spatio-Temporal. Also, we designed spatial Data Mining query language that support a spatial Data Mining exclusive use system based on SIMS.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2000

Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.551-554
• /
• 2003

Aggregate operator which belongs to query operations are important in specialized systems such as geographic information system(GIS) and spatial database system. Most of data describing objects in the real world are characterized by space and time attributes. Till now, however, works on aggregate operations have only dealt with spatial or temporal aspect of object. The current demand of aggregate operations relates to spatiotemporal data which are contained both spatial and temporal data concurrently. Therefore, work on spatiotemporal operations is focused on database area. In this paper, we propose spatiotemporal aggregate functions that operate on spatiotemporal data. Above all, we support spatiotemporal aggregate functions on the basis of three dimensional spatiotemporal models that are defined with the linear one dimensional temporal domain. The proposed algorithms are evaluated through some implementation results. We are sure that the achievement of our work is useful and efficient.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.39-47
• /
• 2004

Spatio-temporal databases have been mostly studied in the area of access methods. However, without considering an extraordinary update maintenance overhead after building up a spatio-temporal index, most indexing techniques have focused on fast query processing only. In this paper, we propose an efficient update management method that reduces the number of disk accesses required in order to apply the updates of moving objects to a spatio-temporal index. We consider realistic update patterns that can represent the movements of objects properly. We present a memory based structure that can efficiently maintain a small number of very frequently updating objects. For an experimental environment with realistic update patterns, the number of disk accesses of our method is about 40% lower than that of a general update method of existing spatio-temporal indexes.