• Title, Summary, Keyword: 연속 k-최근접 질의

Search Result 11, Processing Time 0.036 seconds

도로 네트워크를 위한 k-최근접 이웃 질의의 처리 방안

  • Lee, Sang-Cheol;Kim, Sang-Uk
    • Information and Communications Magazine
    • /
    • v.25 no.7
    • /
    • pp.16-23
    • /
    • 2008
  • 텔레매틱스에서 위치 정보 서비스를 효과적으로 제공하기 위해 이동 객체와 더불어 시설물과 같은 정적 객체에 대한 위치 정보를 효과적으로 관리하는 데이터베이스 기술들이 요구된다 본 논문에서는 도로 네트워크 데이터베이스를 위한 인덱싱 및 질의 처리 기술 현황에 대하여 고찰한다. 텔레매틱스에서는 영역 질의, k-최근접 이웃 질의, 연속 k-최근접 이웃 질의, 공간 조인 질의 등이 발생하며, 이 중 k-최근접 이웃 질의가 빈발하게 발생한다. k-최근접 이웃 질의를 처리하기 위한 효과적인 방안으로 IER, INE, $VN^3$, 근사 인덱싱 기법 등이 있다. 본 논문에서는 각 기법의 개념, 알고리즘, 장단점에 대하여 고찰한다.

Reverse k-Nearest Neighbor Query Processing Method for Continuous Query Processing in Bigdata Environments (빅데이터 환경에서 연속 질의 처리를 위한 리버스 k-최근접 질의 처리 기법)

  • Lim, Jongtae;Park, Sunyong;Seo, Kiwon;Lee, Minho;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.10
    • /
    • pp.454-462
    • /
    • 2014
  • With the development of location aware technologies and mobile devices, location-based services have been studied. To provide location-based services, many researchers proposed methods for processing various query types with Mapreduce(MR). One of the proposed methods, is a Reverse k-nearest neighbor(RkNN) query processing method with MR. However, the existing methods spend too much cost to process the continuous RkNN query. In this paper, we propose an efficient continuous RkNN query processing method with MR to resolve the problems of the existing methods. The proposed method uses the 60-degree-pruning method. The proposed method does not need to reprocess the query for continuous query processing because the proposed method draws and monitors the monitoring area including the candidate objects of a RkNN query. In order to show the superiority of the proposed method, we compare it with the query processing performance of the existing method.

A k-NN Query Processing Method Based on Distance Relation Pattern (거리 관계 패턴을 기반한 k-최근접 질의 처리 기법)

  • Park, Yong-Hun;Seo, Dong-Min;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.85-90
    • /
    • 2008
  • 최근 유클리드 공간 상에서 효율적인 연속 k-최근접(k-Nearest Neighbors) 질의 처리를 위해 그리드 구조 기반의 많은 색인 기법들이 연구되었다. 하지만 기존 기법들은 k-최근접 객체들을 연산하기 위해 불필요한 셀을 접근하여 연산 자원을 낭비하거나 근접한 셀을 알아내는데 너무 큰 연산 비용을 초래한다. 그래서 본 논문에서는 한 셀과 주변 셀과의 거리 관계 패턴을 이용하여 k-최근접 질의 처리시 적은 연산비용과 적은 저장 공간을 사용하는 새로운 k-최근접 질의 처리 기법을 제안한다. 제안하는 기법은 k-최근접 질의 처리 시 거리 값을 기준으로 정렬된 거리 관계 패턴의 상대좌표를 순차적으로 적용하여 근접한 셀을 알아내기 때문에 O(n)의 셀 검색 비용이 요구된다. 또한 본 논문에서는 CPM[1]과 성능을 비교하여 제안하는 기법의 우수성을 입증한다.

  • PDF

An Efficient Construction of Sage Regions for Combined K-NN Query and Non-Place Attributes (K-최근접 질의와 비공간 속성을 결합한 효율적인 안전 영역 할당 기법)

  • Chung, Jae-Wool;Kim, Ung-Mo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • /
    • pp.103-104
    • /
    • 2016
  • 본 논문에서는 GPS의 보급과 무선 통신의 발달로 급격하게 성장 중인 위치 기반 서비스에 대한 연구를 진행하였다. 위치 기반 서비스를 효율적으로 활용하기 위해서 연속 범위 질의(continuous range query)에 비공간적 특성과 K-최근접 질의를 결합한 안전 영역 할당 기법에 대해서 연구를 진행했다. 기존의 안전 영역은 객체간의 거리만으로 할당을 했지만, 본 논문에서는 객체간의 속성이 다르면 안전 영역을 할당하지 않는 기법을 제안했다. 실험결과 기존의 알고리즘 보다 통신 비용이 감소함을 확인할 수 있었지만 K 값에 따른 오차가 발생함을 확인했고 향후, 연구를 지속할 필요가 있다.

  • PDF

A Method for Continuous k Nearest Neighbor Search With Partial Order (부분순위 연속 k 최근접 객체 탐색 기법)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.126-132
    • /
    • 2011
  • In the application areas of LBS(Location Based Service) and ITS(Intelligent Transportation System), continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. It is also able to cope successfully with frequent updates of POI objects. This paper proposes a new method to search nearest POIs for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results with partial order among k-POIs. The results obtained from experiments with real dataset show that the proposed method outperforms the existing methods. The proposed method achieves very short processing time(15%) compared with the existing method.

A Efficient Method of Extracting Split Points for Continuous k Nearest Neighbor Search Without Order (무순위 연속 k 최근접 객체 탐색을 위한 효율적인 분할점 추출기법)

  • Kim, Jin-Deog
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • /
    • pp.927-930
    • /
    • 2010
  • Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

  • 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
    • /
    • /
    • pp.15-16
    • /
    • 2012
  • 본 논문에서는 이동 P2P 환경에서 연속적인 서비스 제공을 위한 k-최근접 질의 처리 기법을 제안한다. 제안하는 기법은 질의 피어와 근접한 k개의 피어를 효율적으로 모니터링하기 위하여 MR(Monitoring-Region)을 배포한다. MR은 주변 피어들의 이동 벡터를 이용하여 시간 범위 내에서 최소 k개의 질의 결과를 보장하기 위해 만들어진 영역이다. 제안하는 기법은 주변 피어들의 벡터를 이용하여 MR을 계산하기 때문에 장시간 유효하며 MR 영역의 무효화에 따른 질의 재수행 비용을 절약한다. 제안하는 기법의 우수성을 입증하기 위해 기존 기법과의 성능평가를 수행한다.

  • PDF

Continuous K-Nearest Neighbor Query Processing Considering Peer Mobilities in Mobile P2P Networks (모바일 P2P 네트워크에서 피어의 이동성을 고려한 연속적인 k-최근접 질의 처리)

  • Bok, Kyoung-Soo;Lee, Hyun-Jung;Park, Young-Hun;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.47-58
    • /
    • 2012
  • In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

Countinuous k-Nearest Neighbor Query Processing Algorithm for Distributed Grid Scheme (분산 그리드 기법을 위한 연속 k-최근접 질의처리 알고리즘)

  • Kim, Young-Chang;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.9-18
    • /
    • 2009
  • Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

  • PDF

Efficient k-Nearest Neighbor Query Processing Method for a Large Location Data (대용량 위치 데이터에서 효율적인 k-최근접 질의 처리 기법)

  • Choi, Dojin;Lim, Jongtae;Yoo, Seunghun;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.8
    • /
    • pp.619-630
    • /
    • 2017
  • With the growing popularity of smart devices, various location based services have been providing to users. Recently, some location based social applications that combine social services and location based services have been emerged. The demands of a k-nearest neighbors(k-NN) query which finds k closest locations from a user location are increased in the location based social network services. In this paper, we propose an approximate k-NN query processing method for fast response time in a large number of users environments. The proposed method performs efficient stream processing using big data distributed processing technologies. In this paper, we also propose a modified grid index method for indexing a large amount of location data. The proposed query processing method first retrieves the related cells by considering a user movement. By doing so, it can make an approximate k results set. In order to show the superiority of the proposed method, we conduct various performance evaluations with the existing method.