• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• Spatial Information Research
• /
• v.15 no.3
• /
• pp.237-249
• /
• 2007

There are about 22,000 national control points throughout this nation. However, in order to identify the location data of a national control point, a control point result table is needed. And although the control points are important national facilities, due to the fact that these points located at remote areas such as on top of mountains, the facilities are being maintained via on-site inspection without any protections around them. In this research, by taking the locations where the control points are placed into consideration, a specialized RFID tags that can be attached to the national control point's marker has been developed, and CDMA-ready PDA based mobile Web System and national control point control system are developed as well. With help of these systems, control point data can be checked at the seen, and national control point maintenance personnel can find out about maintenance status and keep track of usage record. When these systems are taken into effect, access to the national control point data becomes easy, fast response to the change in data can be possible, and management efficiency will go up. When the Ubiquitous society becomes reality, the importance of location information will be high. Therefore, national control points using above mentioned RFID tags will not only be useful to the control point users and maintenance personnels such as professional land surveyors, but also useful when providing location based services to people, and it will become an important national infrastructure in terms of providing absolute location information.

• Journal of Cadastre & Land InformatiX
• /
• v.46 no.1
• /
• pp.117-131
• /
• 2016

The development of LBS(location-based services) due to the widespread mobile environment highlights the importance of POI(point of interest) information. The accurate and up-to-date POI has to be ensured to reflect the information of rapidly changing places. For the efficient construction of POI, here we propose the novel construction system for t he place information. This system is based on crowd-sourcing in which a great number of users participate. In addition, we utilize the graph data model to build the new concept of the place information covering the wide areas extending from the specific point. Moreover, the implementation of the new system applying the graph data model and crowd-sourcing is realized in this paper. That is, this study suggests the whole new concept of the place information and shows the clustering and the renewal of the place information through crowd-sourcing.

• Journal of the HCI Society of Korea
• /
• v.4 no.1
• /
• pp.11-15
• /
• 2009

Social Network Service has been extremely popular these days and providing diverse features and functions to users. Social networking and interest sharing in between users are key factors of SNS and this circles back to draw more users to the service. Web is the first media to provide SNS and mobile is the next. The service based on mobile environmental uniqueness such as Location-based-service(LBS) is the key success factors to convert users to web SNS to mobile SNS. TV has also been a possible SSN market to draw users to share interests and participation. However TV has been always community electronics in family members and personalization to provide SNS has been barrier to overcome. In this study, we explorer ideas of key factors of personalization in TV environment and conducted a field study to define characteristics of TV personalization in terms of depth, method, style and structure. Research finds out that there are significant differences in these categories.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.1
• /
• pp.33-42
• /
• 2016

In Korea, the address-point matching technique has been used to provide geocoding services. In fact, this technique brings the high positional accuracy. However, the quality of geocoding result can be limited, since it is significantly affected by data quality. Also, it cannot be used for the 3D address geocoding and the reverse geocoding. In order to alleviate issues, the paper has implemeted proposed geocoding methods, based on street-based addresses matching technique developed by US census bureau, for street-based addresses in Korea. Those proposed geocoding methods are illustrated in two ways; (1) street address-matching method, which of being used for not only 2D addresses representing a single building but also 3D addresses representing indoor space or underground building, and (2) reverse geocoding method, whichas converting a location point to a readable address. The result of street-based address geocoding shows 82.63% match rates, while the result of reverse geocoding shows 98.5% match rates within approximately 1.7(m) the average position error. According to the results, we could conclude that the proposed geocoding techniques enable to provide the LBS(Location Based Service). To develop the geocoding methods, the study has perfoermed by ignoring the parsing algorithms for address standardization as well as the several areas with unusual addresses, such as sub-urban areas or subordinate areas to the roads, etc. In the future, we are planning the improved geocoding methods for considering these cases.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.13-23
• /
• 2007

Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.1-14
• /
• 2006

Recently, to efficiently support the real-time requirements of LBS and Telematics services, interest in the spatial main memory DBMS is rising. In the spatial main memory DBMS, because all spatial data can be lost when the system failure happens, the recovery system is very important for the stability of the database. Especially, disk I/O in executing the log and the checkpoint becomes the bottleneck of letting down the total system performance. Therefore, it is urgently necessary to research about the recovery system to reduce disk I/O in the spatial main memory DBMS. In this paper, we study an efficient recovery system for the spatial main memory DBMS. First, the pre-commit log method is used for the decrement of disk I/O and the improvement of transaction concurrency. In addition, we propose the fuzzy-shadow checkpoint method for the recovery system of the spatial main memory DBMS. This method can solve the problem of duplicated disk I/O on the same page of the existing fuzzy-pingpong checkpoint method for the improvement of the whole system performance. Finally, we also report the experimental results confirming the benefit of the proposed recovery system.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.67-81
• /
• 2005

Recently, the interest and research on the development of new application services such as the Location Based Service and Telemetics providing the emergency service, neighbor information search, and route search according to the development of the Geographic Information System have been increasing. User's search in the spatio-temporal database which is used in the field of Location Based Service or Telemetics usually fixes the current time on the time axis and queries the spatial and aspatial attributes. Thus, if the range of query on the time axis is extensive, it is difficult to efficiently deal with the search operation. For solving this problem, the snapshot, a method to summarize the location data of moving objects, was introduced. However, if the range to store data is wide, more space for storing data is required. And, the snapshot is created even for unnecessary space that is not frequently used for search. Thus, non storage space and memory are generally used in the snapshot method. Therefore, in this paper, we suggests the Hash-based Spatio-Temporal Clustering Algorithm(H-STCA) that extends the two-dimensional spatial hash algorithm used for the spatial clustering in the past to the three-dimensional spatial hash algorithm for overcoming the disadvantages of the snapshot method. And, this paper also suggests the knowledge extraction algorithm to extract the knowledge for the path search of moving objects from the past location data based on the suggested H-STCA algorithm. Moreover, as the results of the performance evaluation, the snapshot clustering method using H-STCA, in the search time, storage structure construction time, optimal path search time, related to the huge amount of moving object data demonstrated the higher performance than the spatio-temporal index methods and the original snapshot method. Especially, for the snapshot clustering method using H-STCA, the more the number of moving objects was increased, the more the performance was improved, as compared to the existing spatio-temporal index methods and the original snapshot method.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.6
• /
• pp.677-685
• /
• 2011

In order to enhance public transportation and to maintain information credibility, improvement of accuracy regarding route and positional information of public transport is very significant. There have been a variety of methods using GPS to measure accuracy of location-based services. However, the researches of evaluation regarding kinematic position of linear objects measured by vehicle/kinematic GPS are still insufficient. That's why our paper aims to suggest method of evaluation accuracy on a real-time bus route surveyed by GPS by SBM(Single Buffering Method). To make it come true, we compared the findings on the static and dynamic positioning by using PP(Point Positioning), DGPS and GPS/INS integrated systems and analyzed the accuracy and error effects among them, focusing on Anyang city. Consequently, we can find out that in case of P.P. comparing positioning accuracy between RTK DGPS and GPS/INS, both of them have survey result within a margin of error of 5m. More importantly, we can evaluate positional accuracy of each GPS system based on the work provision of a public survey such as error for P.P.(14.5m, 18.1m), DGPS(16.9m, 18.5m), and GPS/INS(18.4m, 18.5m). We are expecting that proposed method in our paper can be utilized in a wide range of categories such as feasibility testing of GPS field survey and high accuracy of positioning for Bus Information System.