Earticle

초록

영어

In 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, we propose a new distributed grid scheme which utilizes node-based pre-computation technique to minimize the update cost of the moving objects' locations. Because our grid scheme manages spatial network data separately from the POIs(Point of Interests) and moving objects, it can minimize the update cost of the POIs and moving objects. Using our grid scheme, we propose a new knearest neighbor (k-NN) query processing algorithm which minimizes the number of accesses to adjacent cells during POIs retrieval in a parallel way. Finally, we show from our performance analysis that our k-NN query processing algorithm is better on retrieval performance than that of the existing SGRID.

목차

Abstract
 I. INTRODUCTION
 II. RELATED WORK
 III. DISTRIBUTED GRID SCHEME
 IV. NEW K-NN QUERY PROCESSING ALGORITHM
 V. PERFORMANCE ANALYSIS
 VI. CONCLUSION AND FUTURE WORK
 ACKNOWLEDGMENT
 REFERENCES

키워드

저자

• Seungtae Hong [ Dept. of Computer Engineering Chonbuk National University Chonju, Chonbuk ]
• Jaewoo Chang [ Dept. of Computer Engineering Chonbuk National University Chonju, Chonbuk ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  JoC [Journal of Convergence]

• 간기

  계간

• pISSN

  2093-7741

• eISSN

  2093-775X

• 수록기간

  2010~2015

• 십진분류

  KDC 004 DDC 004