Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Spatio-temporal composition and indexing for large multimedia applications
Multimedia Systems
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
On Optimal Multiversion Access Structures
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Journal of Computer and System Sciences - Special issue on PODS 2000
GIS: A Computing Perspective, 2nd Edition
GIS: A Computing Perspective, 2nd Edition
The self-relocating index scheme for telematics GIS
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
Due to the continuous growth of wireless communication technology and mobile equipment, the history management of moving object is important in a wide range of location-based applications. To process queries for history data, trajectories, we generally use trajectory-preserving index schemes based on the trajectory preservation property. This property means that a leaf node only contains segments belonging to a particular trajectory, regardless of the spatiotemporal locality of segments. The sacrifice of spatiotemporal locality, however, causes the index to increase the dead space of MBBs of non-leaf nodes and the overlap between the MBBs of nodes. Therefore, an index scheme for trajectories shows good performance with trajectory-based queries, but not with coordinate-based queries, such as range queries. We propose new index schemes that improve the performance of range queries without reducing performance with trajectory based queries.