한국공간정보시스템학회:학술대회논문집
- 2004.12a
- /
- Pages.113-116
- /
- 2004
Bulk Updating Moving Points for the TPR-tree
TPR-Tree를 위한 이동 점의 묶음 갱신
- Hoang Do Thanh Tung (Database Laboratory, Chungbuk National University) ;
- Lee Eung-Jae (Database Laboratory, Chungbuk National University) ;
- Lee Yang-Koo (Database Laboratory, Chungbuk National University) ;
- Ryu Keun-Ho (Database Laboratory, Chungbuk National University)
- Published : 2004.12.10
Abstract
Assisted by high technologies of information and communication in storing and collecting moving object information, many applications have been developing technical methods to exploit databases of moving objects effectively and variously. Among them, today, Current and Anticipated Future Position Indexing methods manage current positions of moving objects in order to anticipate future positions of them or more complex future queries. They, however, strongly demand update performance as fast enough to guarantee certainty of queries as possible. In this paper, we propose a new indexing mettled derived from the TPR-tree that should has update performance considerably improved, we named it BUR-tree. In our method, index structure can be inserted, deleted, and updated with a number (or bulk) of objects simultaneously rather than one object at a time as in conventional methods. This method is intended to be applied to a traffic network in which vast number of objects, such as cars, pedestrians, moves continuously.
Keywords