A Comparison Study of Moving Object Index Structures |
| |
Authors: | Utku Kalay Oya Kalipsiz |
| |
Affiliation: | Computer Engineering Department, Yildiz Technical University, Besiktas, Istanbul, 34349, Turkey |
| |
Abstract: | The task of selecting the most appropriate method for indexing the data according to application requires a careful comparison
study of indices of interests. In particular, we consider object movements by tracing their trajectories within a predefined
road network. MV3DR-tree and 3DR-tree constitute our first group indexing the objects moving in free movement scenarios. Besides,
Mapping and MON-tree are the second group indexing the locations of objects moving over a network of road. Those access methods
mainly organize a group of R-tree in order to index the underlying road network and the object movements. Our goal in this
study is to evaluate existing proposals under fair circumstances with respect to storage consumption and spatio-temporal query
execution performance. In our comparisons, we discuss the structure’s sensibility to query’s spatial and/or temporal extent
as well as the tradeoff arising between two groups in terms of reliability and disk access performance. We believe that revealing
the vulnerabilities of the selected structures, especially Mapping and MON-tree motivates us to design more robust organizations. |
| |
Keywords: | |
本文献已被 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|