Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Close pair queries in moving object databases
Proceedings of the 13th annual ACM international workshop on Geographic information systems
A spatio-temporal access method based on snapshots and events
Proceedings of the 13th annual ACM international workshop on Geographic information systems
On past-time indexing of moving objects
Journal of Systems and Software
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
A real-time mobile GIS based on the HBR-tree for location based services
Computers and Industrial Engineering - Special issue: Computational intelligence and information technology applications to industrial engineering selected papers from the 33 rd ICC&IE
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Multiversion join index for multiversion data warehouse
Information and Software Technology
Searching for similar trajectories in spatial networks
Journal of Systems and Software
A real-time mobile GIS based on the HBR-tree for location based services
Computers and Industrial Engineering
The RUM-tree: supporting frequent updates in R-trees using memos
The VLDB Journal — The International Journal on Very Large Data Bases
Data management challenges for computational transportation
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
A meta-index for querying distributed moving object database servers
Information Systems
A spatio-temporal-textual crime search engine
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Real-time temporal data warehouse cubing
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Techniques for indexing and querying temporal observations for a collection of objects
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Location polling algorithm for alerting service based on location
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
History-independence: a fresh look at the case of R-trees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
An integrated framework for spatio-temporal-textual search and mining
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Abstract: The Historical R-tree is a spatio-temporal access method aimed at the retrieval of window queries in the past. The concept behind the method is to keep an R-tree for each timestamp in history, but allow consecutive trees to share branches when the underlying objects do not change. New branches are only created to accommodate updates from the previous timestamp. Although existing implementations of HR-trees process timestamp (window) queries very efficiently, they are hardly applicable in practice due to excessive space requirements and poor interval query performance. This paper addresses these problems by proposing the HR+-tree, which occupies a small fraction of the space required for the corresponding HR-tree (for typical conditions about 20%), while improving interval query performance several times. Our claims are supported by extensive experimental evaluation.