• Title/Summary/Keyword: Continuous k-nearest Neighbor Query

Search Result 14, Processing Time 0.027 seconds

Design and Implementation of Advanced Traffic Monitoring System based on Integration of Data Stream Management System and Spatial DBMS

  • Xia, Ying;Gan, Hongmei;Kim, Gyoung-Bae
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.162-169
    • /
    • 2009
  • The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

  • PDF

A Study on Valid Time for Nearest Neighbor Query of Moving Objects (이동 객체의 최근접 질의를 위한 유효 시간에 관한 연구)

  • Kang, Ku-An;Lee, Sang-Wook;Kim, Jin-Doeg
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.163-166
    • /
    • 2005
  • The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the time when a query point and objects are moving at the same time. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

  • PDF

A Continuous k-Nearest Neighbor Query Processing Method in Mobile P2P Environments (이동 P2P 환경에서 연속적인 k-최근접 질의 처리 기법)

  • Lee, hyun-jung;Bok, kyoung-soo;Park, yong-hun;Lim, jong-tae;Lee, sang-kyu;Yoo, jae-soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2012.05a
    • /
    • pp.15-16
    • /
    • 2012
  • 본 논문에서는 이동 P2P 환경에서 연속적인 서비스 제공을 위한 k-최근접 질의 처리 기법을 제안한다. 제안하는 기법은 질의 피어와 근접한 k개의 피어를 효율적으로 모니터링하기 위하여 MR(Monitoring-Region)을 배포한다. MR은 주변 피어들의 이동 벡터를 이용하여 시간 범위 내에서 최소 k개의 질의 결과를 보장하기 위해 만들어진 영역이다. 제안하는 기법은 주변 피어들의 벡터를 이용하여 MR을 계산하기 때문에 장시간 유효하며 MR 영역의 무효화에 따른 질의 재수행 비용을 절약한다. 제안하는 기법의 우수성을 입증하기 위해 기존 기법과의 성능평가를 수행한다.

  • PDF