한국정보처리학회:학술대회논문집 (Proceedings of the Korea Information Processing Society Conference)
- 한국정보처리학회 2003년도 추계학술발표논문집 (하)
- /
- Pages.1429-1432
- /
- 2003
- /
- 2005-0011(pISSN)
- /
- 2671-7298(eISSN)
제약을 가진 최소근접을 찾는 이동질의의 효율적인 수행
A Efficient Query Processing of Constrained Nearest Neighbor Search for Moving Query Point
- 반재훈 (경남정보대학 인터넷응용계열)
- Ban, Chae-Hoon (Subdivision of Internet Application, Kyungnam College of Information of Technology)
- 발행 : 2003.11.14
초록
This paper addresses the problem of finding a constrained nearest neighbor for moving query point(we call it CNNMP) The Nearest neighbor problem is classified by existence of a constrained region, the number of query result and movement of query point and target. The problem assumes that the query point is not static, as 1-nearest neighbor problem, but varies its position over time to the constrained region. The parameters as NC, NCMBR, CQR and QL for the algorithm are also presented. We suggest the query optimization algorithm in consideration of topological relationship among them
키워드