摘要
Moving objects continuously generate large amounts of spatio-temporal data. Maintaining and querying the location information of moving objects are a crucial problem. This paper focuses on the query problems of indexing structure for moving objects. The main focus of query processing is retrieval of approximate future movement information about moving objects that may be unavailable. First, a VPMR-tree is proposed for indexing the moving objects in road networks. Second, exponential smoothing method for predicting the result of queries that refer to the future is implemented. The experimental results have shown that VPMR-tree achieves a better performance for query evaluation than TPR-tree.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 2 |
| 出版商 | IEEE; IEEE Circuits and Systems Society (CAS); IEEE Communications Society (ComSoc); IEEE Computer Society; IEEE Signal Processing Society |
| 页 | 555-+ |
| 页数 | 2 |
| ISBN(印刷版) | 0-7695-2581-4 |
| 出版状态 | 已出版 - 20 6月 2006 |
丛书
| 姓名 | Querying about the near future positions of moving objects |
|---|
基金资助
This work was supported by a grant from the Natural Science Found of China and 863 projects under Grant 60173045, 2005AA122320.
收录
- CPCI-S
学术指纹
探究 'Querying about the near future positions of moving objects' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver