• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.59-75
• /
• 2006

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.34-36
• /
• 2003

최근 들어 위치정보 시스템(GIS)의 발전으로 움직이는 물체의 위치는 쉽게 알 수 있게 되어서 이를 기반으로 미래의 최근접 쌍을 찾는 질의가 중요하게 되었다. 하지만 이동객체는 계속해서 움직이므로 현재의 질의 결과는 시간이 흐름에 따라 유효하지 않게 된다. 본 논문에서는 사용자에게 현재의 가장 인접한 쌍과 이 인접한 쌍이 유효한 시간, 그리고 그 유효한 시간 후에 바뀐 결과를 알려주는 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.193-195
• /
• 2001

이동체는 끊임 없이 위치 정보를 변경하는 특징을 가지고 있다. 빈번한 데이터 변경이 발생하는 이동체에 대한 효율적인 색인 기법의 대한 연구가 필요하다. 이 논문에서는 이동체의 공간 데이터 표현 방법과 색인 변경 정책을 제안한다. 그리고 제안한 색인 변경 정책에 따른 공간 색인별 성능 평가와 구축된 공간 색인의 영역 질의 처리에 대한 성능 평가를 위한 실험 평가기를 설계한다. 실험을 통해 이동체 데이터베이스에서 효율적으로 사용 가능한 색인을 도출해 낼 수 있으며, 실험 결과물의 하나인 성능 평가기를 사용하여 향후 개발할 이동체를 위한 새로운 색인에 대한 성능 평가도 수행할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.187-190
• /
• 2004

시스템 설계가 시스템 요구 사항을 만족하지 않으면 시스템 구현 후 처음부터 다시 설계 및 구현을 해야 함으로 시스템 설계 단계에서 설계한 시스템이 요구 사항을 만족하는지 검증하는 것이 매우 중요하다. 일반적 시스템 요구 사항 중에는 시스템이 항상 막힘없이 작동 (live)해야 한다는 것과 시스템 자원의 총합이 한계값을 넘지 말아야 한다 (bounded)는 것이 있다. 본 논문에서는 이동물체 데이터베이스 시스템이 구조적으로 live하고 bounded 한지 검증하는 페트리 넷 방법을 소개한다.

• Korean Institute of Interior Design Journal
• /
• v.14 no.3 s.50
• /
• pp.216-223
• /
• 2005

In this study, we would like to suggest a virtual model house where the users participate in the planning of the apartment directly in order to supply the apartment which is suitable for the fast change of the resident's characterization, multiplication, and preference in this like high-speed information society. The users have various preferences and demands in the high level information society. It is necessary for the architect to communicate with the users in order to suggest the various styles of habitats that one can treat various life style and life cycle which reflects the demand. In addition, the object of this paper is the construction and using of the participating virtual model house that the resident can plan the preferred space design of the main house before moving Into the apartment and change space design of the main house after moving into the apartment following the variety of life style and the changing of life cycle. Regarding the effect of this study, firstly, it is possible to supply the plate type following the user's preference in order to enhance the quality of uniformed type apartment. Secondly, it is possible to maintain and control the high quality building using sharing the building information with planning, construction, maintain, interior, and related company by constructing the database. Thirdly, the unified database which is constructed by XML can supply the effective environment of apartment information exchange between other companies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1791-1794
• /
• 2002

이동체데이터베이스((MODB : Moving Object Database)는 사람이나 또는 자동차와 같이 이동성을 가지는 객체를 저장하고 관리하는 시스템이다. LBS(Location-Based Services)의 활성화로 인해서 위치정보(Location Information)는 다양하고 고부가가치의 서비스를 가능하게 하였으며, 차세대 무선인터넷 서비스의 킬러 어플리케이션으로 확대될 전망에 있다. 이러한 LBS 시스템에서 대용량의 위치정보를 저장하고, 빠르게 접근하는 이동체데이터베이스는 LBS 플랫폼의 핵심 기능 중의 하나이다. 향후에 위치정보를 이용한 서비스가 확대되어, 일반인이 쉽게, 그리고 필수적으로 사용되는 기능으로 확대 되었을 때, 이동체데이터베이스의 중요성은 더욱 커질 것이며, 이동체데이터베이스의 시스템 부하는 그만큼 커지게 된다. 더군다나 대용량 이동체 정보를 획득하는 부분에서도 통신부하의 심각성은 미리 고려되어져야 함을 쉽게 예측할 수가 있다. 즉, 대용량의 위치정보를 다양한 디바이스를 통해서 무선인터넷환경에서 획득하려고 할 때, 그 수가 많으면 많을수록 통신부하는 점점 커지며, 획득한 정보는 이미 과거의 정보가 되어서 사용할 수 없는 정보가 될 수가 있다. 이에 본 논문에서는 이동체데이터베이스의 위치획득 부분에서 통신 부하를 줄이기 위한 다양한 모델에 대해서 논의하고 구현에 앞서 설계한다.

• Journal of Korea Multimedia Society
• /
• v.9 no.4
• /
• pp.388-400
• /
• 2006

There are wireless location acquisition technique, LBS platform technique, and LBS application technique in the important technical elements of the LBS. In this paper, we design a location data management system which is the core base technique of the important technical elements of the LBS. The proposed system consist of an application interface of LBS, a query processor of application. service, a location estimator of the moving objects, a location information manager, a real-time data receiver, and a database of location data. This system manages efficiently the location change information of the moving objects using the database technique, suggests some useful inform to the users of LBS, and supports operation and facility of location estimation to process continuous location data of the moving objects. On the basis of location data triggering, this system supplements the problem of the related location data management systems to complement the loss of location data in the environment of real-time.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.65-74
• /
• 2003

Location-based service is an important spatiotemporal database application area that provides the location-aware information of wireless terminals via positioning devices such as GPS. With the rapid advances of wireless communication systems, the requirement of mobile application areas including traffic, mobile commerce and supply chaining management became the center of attention for various research issues in spatiotemporal databases. In this paper we present the A-Quadtree, an efficient indexing method for answering location-based queries where the movement vector information (e.g., speed and velocity) is not presented. We implement the A-Quadtree with an index structure for object identifiers as a.Net component to apply the component to multiplatforms. We present our approach and describe the performance evaluation through various experiments. In our experiments, we compare the performance with previous approaches and show the enhanced efficiency of our method.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.67-79
• /
• 2005

For tracing tag locations, the trajectories should be modeled and indexed in a radio frequency identification (RFID) system. The trajectory of a tag is represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as intervals and new index scheme called the Interval R-tree. We also propose new insert and split algorithms to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with the R-tree and the R*-tree. Our experiments show that the new index scheme outperforms the other two in processing queries of tags on various datasets.