• Title/Summary/Keyword: Approximate CTNN

Search Result 5, Processing Time 0.022 seconds

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Chung, Ji-Moon
    • Journal of Digital Convergence
    • /
    • v.3 no.1
    • /
    • pp.149-163
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Jeong, Ji-Mun
    • 한국디지털정책학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.517-530
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

Nearest Neighbor Query Processing Techniques in Location-Aware Environment

  • Kim, Sang-Ho;Choi, Bo-Yoon;Ryu, Keun-Ho;Nam, Kwang-Woo;Park, Jong-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.715-717
    • /
    • 2003
  • Some previous works for nearest neighbor (NN) query processing technique can treat a case that query/data are both moving objects. However, they cannot find exact result owing to vagueness of criterion. In order to escape their limitations and get exact result, we propose new NN query techniques, exact CTNN (continuous trajectory NN) query, approximate CTNN query, and dynamic CTNN query. These are all superior to pervious works, by reducing of number of calculation, considering of trajectory information, and using of continuous query concept. Using these techniques, we can solve any situations and types of NN query in location-aware environment.

  • PDF

Continuous Nearest Neighbor Query Processing on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의 처리)

  • 지정희;최보윤;김상호;류근호
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.492-504
    • /
    • 2004
  • Recently, as growing of interest for LBS(location-based services) techniques, lots of works on moving objects that continuously change their information over time, have been performed briskly. Also, researches for NN(nearest neighbor) query which has often been used in LBS, are progressed variously However, the results of conventional NN Query processing techniques may be invalidated as the query and data objects move. Therefore, they are usually meaningless in moving object management system such as LBS. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet accurate and continuous query processing for moving objects. Our techniques include an Approximate CTNN(ACTNN) technique, which has quick response time, and an Exact CTNN(ECTNN) technique, which makes it possible to search nearest neighbor objects accurately. In order to evaluate the proposed techniques, we experimented with various datasets. Experimental results showed that the ECTNN technique has high accuracy, but has a little low performance for response time. Also the ACTNN technique has low accuracy comparing with the ECTNN, but has quick response time The proposed techniques can be applied to navigation system, traffic control system, distribution information system, etc., and specially are most suitable when both data and query are moving objects and when we already know their trajectory.

The Nearest Neighbor Query for Trajectory of Moving Objects (이동 객체 궤적에 대한 최근접 질의)

  • Choi, Bo-Yoon;Chi, Jeong-Hee;Kim, Sang-Ho;Ryu, Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2003.11a
    • /
    • pp.169-174
    • /
    • 2003
  • 이동 객체에 대한 기존 최근접(nearest neighbor, NN) 질의 처리 기법들은 질의 궤적에 대해 연속적으로 정확하게, 질의와 가장 가까운 위치를 유지하면서 움직이는 최근접 객체를 선택할 수 있는 충분한 기준을 가지고 있지 못하다. 이 논문은 질의 객체와 데이터 객체가 모두 이동 객체인 경우에 가장 적합하게 사용되는 객체 궤적에 대한 연속적인 질의 처리를 통해 정확한 결과를 얻을 수 있는 새로운 최근접 질의 처리 기법, 연속 궤적 최근접 질의(CTNN, continuous trajectory nearest neighbor query)를 제안한다. 우리는 두 가지 Approximate, Exact CTNN 기법을 제안하며 이들은 모두 항해 시스템, 교통 통제 시스템, 물류정보 시스템 등 각종 위치 기반 서비스(L8S: location based services) 상에서 다양하게 사용될 수 있다. 이들은 이동 객체 궤적이 미리 알려져 있는 경우 그리고 질의와 데이터 객체가 모두 이동 객체인 경우에 가장 적합하다.

  • PDF