Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The Computer Journal - Special issue on parallel computing
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
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
Overlapping linear quadtrees and spatio-temporal query processing
The Computer Journal
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
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
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
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Cost Models for Overlapping and Multi-Version B-Trees
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of predictive spatio-temporal queries
ACM Transactions on Database Systems (TODS)
Journal of Computer Science and Technology
Querying about the Past, the Present, and the Future in Spatio-Temporal Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Spatiotemporal Aggregate Computation: A Survey
IEEE Transactions on Knowledge and Data Engineering
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Trajectory Indexing Using Movement Constraints
Geoinformatica
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A trajectory splitting model for efficient spatio-temporal indexing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Close pair queries in moving object databases
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Time relaxed spatiotemporal trajectory joins
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Modeling Multiple Time Series for Anomaly Detection
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Proceedings of the 15th international conference on World Wide Web
Efficient processing of past-future spatiotemporal queries
Proceedings of the 2006 ACM symposium on Applied computing
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing Multidimensional Time-Series
The VLDB Journal — The International Journal on Very Large Data Bases
Global distance-based segmentation of trajectories
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
On past-time indexing of moving objects
Journal of Systems and Software
Discovery of Periodic Patterns in Spatiotemporal Sequences
IEEE Transactions on Knowledge and Data Engineering
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
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
TS2-tree - an efficient similarity based organization for trajectory data
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
A spatiotemporal view of transactional data for data mining
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Efficient Maintenance of Continuous Queries for Trajectories
Geoinformatica
Knowledge Aquisition and Data Storage in Mobile GeoSensor Networks
GeoSensor Networks
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Indexing of Moving Objects on Road Network Using Composite Structure
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Indexing Moving Objects for Trajectory Retrieval on Location-Based Services
IEICE - Transactions on Information and Systems
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)
Elastic non-contiguous sequence pattern detection for data stream monitoring
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Processing (multiple) spatio-temporal range queries in multicore settings
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Efficient indexing methods of continuously moving object in wireless networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
An efficient trajectory index structure for moving objects in location-based services
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Boundary-Based time partitioning with flattened r-tree for indexing ubiquitous objects
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
PA-tree: a parametric indexing scheme for spatio-temporal trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
Spatiotemporal objects i.e., objects which change their position and/or extent over time, appear in many applications. This paper addresses the problem of indexing large volumes of such data. We consider general object movements and extent changes. We further concentrate on "snapshot" as well as small "interval" historical queries on the gathered data. The obvious approach that approximates spatiotemporal objects with MBRs and uses a traditional multidimensional access method to index them is inefficient. Objects that "live" for long time intervals have large MBRs which introduce a lot of empty space. Clustering long intervals has been dealt in temporal databases by the use of partially persistent indices. What differentiates this problem from traditional temporal indexing is that objects are allowed to move/change during their lifetime. Better methods are thus needed to approximate general spatiotemporal objects. One obvious solution is to introduce artificial splits: the lifetime of a long-lived object is split into smaller consecutive pieces. This decreases the empty space but increases the number of indexed MBRs. We first introduce two algorithms for splitting a given spatiotemporal object. Then, given an upper bound on the total number of possible splits, we present three algorithms that decide how the splits should be distributed among the objects so that the total empty space is minimized.