• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.176-183
• /
• 2003

Various techniques including histograms, sampling and parametric techniques have been proposed to estimate query result sizes for the query optimization. Histogram-based techniques are the most widely used form for the selectivity estimation in relational database systems. However, in the spatio-temporal databases for the moving objects, the continual changes of the data distribution suffer the direct utilization of the state of the art histogram techniques. Specifically for the future queries, we need another methodology that considers the updated information and keeps the accuracy of the result. In this paper we propose a novel approach based upon the duality and the marginal distribution to construct a histogram with very little time since the spatio-temporal histogram requires the data distribution defined by query predicates. We use data synopsis method in the dual space to construct spatio-temporal histograms. Our method is robust to changing data distributions during a certain period of time while the objects keep the linear movements. An additional feature of our approach supports the dynamic update incrementally and maintains the accuracy of the estimated result.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Journal of Preventive Medicine and Public Health
• /
• v.54 no.5
• /
• pp.301-308
• /
• 2021

Objectives: Despite its advantages, it is not yet common practice in Korea for researchers to investigate disease associations using spatio-temporal analyses. In this study, we aimed to review health-related epidemiological research using spatio-temporal analyses and to observe methodological trends. Methods: Health-related studies that applied spatial or spatio-temporal methods were identified using 2 international databases (PubMed and Embase) and 4 Korean academic databases (KoreaMed, NDSL, DBpia, and RISS). Two reviewers extracted data to review the included studies. A search for relevant keywords yielded 5919 studies. Results: Of the studies that were initially found, 150 were ultimately included based on the eligibility criteria. In terms of the research topic, 5 categories with 11 subcategories were identified: chronic diseases (n=31, 20.7%), infectious diseases (n=27, 18.0%), health-related topics (including service utilization, equity, and behavior) (n=47, 31.3%), mental health (n=15, 10.0%), and cancer (n=7, 4.7%). Compared to the period between 2000 and 2010, more studies published between 2011 and 2020 were found to use 2 or more spatial analysis techniques (35.6% of included studies), and the number of studies on mapping increased 6-fold. Conclusions: Further spatio-temporal analysis-related studies with point data are needed to provide insights and evidence to support policy decision-making for the prevention and control of infectious and chronic diseases using advances in spatial techniques.

• 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 KIISE:Databases
• /
• v.27 no.1
• /
• pp.101-112
• /
• 2000

In Geographic Information System, spatial object can be changed in the attribute information, spatial location and the topological relation between them with the change of time. However traditional GIS deletes the old value of aspatial information and replaces them with new value. Therefore. it is difficult to manage thc history of changed spatial object and can not support the spatio-temporal queries including temporal queries. In this paper, we propose a spatio-temporal objected model to solve this problem. We implement the proposed model with spatio-temporal class using Gothic GIS tool. The historical information of an object is stored into the object itself for the effective history management. And, in order to provide the queries for the history of an object and spatio-temporal relationship, we add temporal operators, spatio-temporal operators, and spatio-temporal query operations into Gothic, and improve the facility of the Gothic.

• ETRI Journal
• /
• v.24 no.3
• /
• pp.226-238
• /
• 2002

A spatial object changes its states over time. However, existing spatial and temporal database systems cannot fully manage time-varying data with both spatial and non-spatial attributes. To overcome this limitation, we present a framework for spatio-temporal databases that can manage all time-varying historical information and integrate spatial and temporal relationship operators into the select statement in SQL3. For the purpose of our framework, we define three referencing macros and a history aggregate operator and classify the existing spatial and temporal relationship operators into three groups: exclusively spatial relationship operators, exclusively temporal relationship operators, and spatio-temporal common relationship operators. Finally, we believe the integration of spatial and temporal relationship operators into SQL3 will provide a useful framework for the history management of time-varying spatial objects in a uniform manner.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.463-475
• /
• 2006

In applications such as a traffic management system, analysis using a spatial hierarchy of a spatial data warehouse and a simple aggregation is required. Over the past few years, several studies have been made on solution using a spatial index. Many studies have focused on using extended R-tree. But, because it just provides either the current aggregation or the total aggregation, decision support of traffic policy required historical analysis can not be provided. This paper proposes hybrid index based on extended aR-tree for the spatio-temporal aggregation. The proposed method supports a spatial hierarchy and the current aggregation by the R-tree. The sorted hash table using the time structure of the extended aR-tree provides a temporal hierarchy and a historical aggregation. Therefore, the proposed method supports an efficient decision support with spatio-temporal analysis and is Possible currently traffic analysis and determination of a traffic policy with historical analysis.

• Journal of the Economic Geographical Society of Korea
• /
• v.20 no.2
• /
• pp.158-172
• /
• 2017

This study analyzes the time-space variability for the weekly passenger flow of the Seoul Subway system based on the dynamic visualization methods. For the purpose, we utilize one-week T-card transaction databases. By applying data mining algorithms, we extract passenger data for edge flows, on/off passengers at each subway station per minute interval time. It is practically intractable to analyze such spatio-temporal passenger flows by general statistical techniques. We employ dynamic visualization methods to analyze intuitively and to grasp effectively characteristics of the diurnal passenger flows on the Seoul Metropolitan Subway system during one week. As the result, we found that substantial differences exist on the spatio-temporal distribution patterns among days as well as between weekdays and weekend. We also investigates the time-space variability among eight major centers, and we found wide differences in their spatio-temporal distribution patterns.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.451-463
• /
• 2003

Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.272-275
• /
• 2004

Recently, the services using position information of moving objects is embossed. Theses services needs the moving objects databases to manage moving object data with efficiency. To build the moving object databases, we must develop the moving object engine to mange, store, and search the spatio temporal data of moving object. The moving object engine has to support query syntax to search data that suitable for user need like LBS, Telematics, ITS, vehicle management system. In this paper, we design and implement the moving object engine to support service with moving object data. The moving object engine is able to support system environment that users are able to get the moving object data easily even they don't know complex data structure.