• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1266-1272
• /
• 2004

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.364-370
• /
• 2014

The management and analysis of spatio-temporal and multimedia data is a hot issue in database research because such data types are handled in manny applications. Querying databases of such a content is very important for these applications. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. We compare and analyze our algorithms and MBR by experiments. Our algorithms make smaller size of index structure and process more efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.418-421
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• International Journal of Highway Engineering
• /
• v.20 no.3
• /
• pp.85-92
• /
• 2018

PURPOSES : In this study, analyze the characteristics of IOC indicator 'threshold' which is needed when evaluating the traffic signal operation status with ESPRESSO in various grade road traffic environment of Seoul metropolitan city and derive suggested value to use in field practice. METHODS : Using the computerized database program (Postgresql), we extracted data with regional characteristics (Arterial, Collector road) and temporal characteristics (peak hour, non-peak hour). Analysis of variance and Duncan's validation were performed using statistical analysis program (SPSS) to confirm whether the extracted data contains statistical significance. RESULTS : The analysis period of the main and secondary arterial roads was confirmed to be suitable from 14 days to 60 days. For the arterial, it is suggested to use 20 km/h as the critical speed for PM peak hour and weekly non peak hour. It is suggested to use 25 km/h as the critical speed for AM peak hour and night non peak hour. As for the collector road, it is suggested to use 20 km/h as the critical speed for PM peak hour and weekly non peak hour. It is suggested to use 30 km/h as the critical speed for AM peak hour and night non peak hour. CONCLUSIONS : It is meaningful from a methodological point of view that it is possible to make a reasonable comparative analysis on the signal intersection pre-post analysis when the signal operation DB is renewed by breaking the existing traffic signal operation evaluation method.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.287-296
• /
• 2004

Recently, various location-based services are becoming very popular in mobile environments. In this paper, we propose a new concept of a frequent item set, called “associative class set”, for supporting the location-based service which uses a large quantity of a spatial database in mobile computing environments, and then present a new method for efficiently generating the associative class set. The associative class set is generated with considering the temporal relation of queries, the spatial distance of required objects, and access patterns of users. The result of our research can play a fundamental role in efficiently supporting location-based services and in overcoming the limitation of mobile environments. The associative class set can be applied by a recommendation system of a geographic information system in mobile computing environments, mobile advertisement, city development planning, and client cache police of mobile users.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.63-76
• /
• 2005

Recently, the wireless positioning techniques and mobile computing techniques were developed with rapidly to use location data of moving objects. Also, the demand for LBS(Location Based Services) which uses location data of moving objects is increasing rapidly. In order to support various LBS, a system that can store and retrieve location data of moving objects efficiently is required necessarily. The more the number of moving objects is numerous and the more periodical sampling of locations is frequent, the more location data of moving objects become very large. Hence the system should be able to efficiently manage mass location data, support various spatio-temporal queries for LBS, and solve the uncertainty problem of moving objects. Therefore, in this paper, we presented a hash technique, a clustering technique and a trajectory search technique to manage location data of moving objects efficiently And, we have developed a Mass Moving Object Location Data Management System, which is a disk-based system, that can store and retrieve location data of mass moving objects efficiently and support the query for spatio-temporal data and the past location data with uncertainty. By analying the performance of the Mass Moving Object Locations Management system and the SQL-Server, we can find that the performance of our system for storing and retrieving location data of moving objects was about 5% and 300% better than the SQL-Server, repectively.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.63-72
• /
• 2011

Urban space structure tends to have a significant change in accordance with maintenance of urban infrastructure such as a traffic route. For this reason, quantitative analysis has been needed to establish spatial distribution and location patterns by considering change of both road accessibility and urban infrastructure level, which can have the most pervasive influence in urban development process. Therefore, this paper aims to analyze spatio-temporal urban morphology through considering distribution patterns of road among transportation infrastructures, population, and spatial structure of metropolitan areas, focusing on Seoul where population growth and the size of urban area have been dramatically increased. For this, we firstly developed and constructed time-series GIS database by using satellite images and topographic maps of the last 70 years to analyze variables which affect urban growth and transportation. In particular, we analyzed the transform of the system of the street by Space Syntax which is able to grasp hierarchical spatial structure through visibility of space and spatial cognition in terms of accessibility. What's more, we analyzed and visualized the relationship urban morphology and road according the regions of Seoul through IPA(Importance Performance Analysis). In terms of the integration land-use and transportation, Space Syntax approach is expected to contribute to efficient urban planning through understanding the influence which various transportation phenomena has an effect on urban development patterns.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.2 s.40
• /
• pp.87-93
• /
• 2007

Over the years, Advanced Public Transportation System (APTS) has been implemented to manage and operate public transportation system. With the expanding mass spatio-temporal data such as comprehensive spatial information of each individual passenger and public transportation vehicle, it has been required to consolidate and analyze these multiple data sets from various sources. This paper demonstrates how GIS is utilized for the consolidation of massive transit related spatio-temporal information. And it presents effective applications to improve transit planning process and support transit related decision-making activities. GIS based system is used to combine multi-agents' data in the areas of transit operation and individual transit ride and transfer management. Due to the unique comprehensiveness and the level of detail of the data provide by the Seoul Transit system, this GIS based information consolidation is the first in its class. Based on the integrated database, this paper describes the effective and efficient GIS based analysis deployed in a transportation system planning process. The data integration systems and analytic models developed in this paper can be transferred and applied by any municipal governments provided that the appropriate data is available.

• Journal of the Korean association of regional geographers
• /
• v.16 no.6
• /
• pp.706-723
• /
• 2010

The impervious surface was frequently employed as a proxy of the total environmental burden in the urban area. The impervious surface was extracted from a satellite image and the GIS (Geographical Information System) database for childhood asthma hospitalizations was generated for a total of 62,136 children using the National Health Insurance database of South Korea. Children living in an impervious environment do result in almost twice as many hospitalizations (26.58%) for asthma, as compared to the sub-urban pervious living (15.82%). Furthermore, the risk zones with persistently high hospitalizations for three years were specifically identified over the impervious sub-district alone. The impervious zone showed a small inter-year variation of hospitalizations (r: 0.937) while the sub-urban pervious fringe was found to display a yearly variation(r: 0.371). The strong temporal autocorrelation means that the impervious areas have frequent long-lived hospitalizations for asthma, thus children living in impervious areas were likely to have had more chronic asthma attacks than those living in pervious areas. These experimental results indicate that an impervious surface as thematic parameter of analysis is a crucial explanatory variable for asthma hospitalizations and its longer persistence among children.