Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
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
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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)
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
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
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
Aggregation and comparison of trajectories
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Oporto: A Realistic Scenario Generator for Moving Objects
Geoinformatica
A Framework for Generating Network-Based Moving Objects
Geoinformatica
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
IEEE Transactions on Computers
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
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
An Online Algorithm for Segmenting Time Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
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
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Continuous Queries within an Architecture for Querying XML-Represented Moving Objects
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
On nearest neighbor indexing of nonlinear trajectories
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Analysis of predictive spatio-temporal queries
ACM Transactions on Database Systems (TODS)
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Performance Analysis of R*-Trees with Arbitrary Node Extents
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on the Web (TWEB)
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On-line discovery of hot motion paths
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Scalable processing of trajectory-based queries in space-partitioned moving objects databases
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Efficient search of moving objects on a planar graph
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Querying trajectories using flexible patterns
Proceedings of the 13th International Conference on Extending Database Technology
Real-time monitoring of water quality using temporal trajectory of live fish
Expert Systems with Applications: An International Journal
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Boosting spatial pruning: on optimal pruning of MBRs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Anonymization of moving objects databases by clustering and perturbation
Information Systems
Querying the future of spatio-temporal objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing temporal data with virtual structure
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Indexing in-network trajectory flows
The VLDB Journal — The International Journal on Very Large Data Bases
Spatial-temporal data evaluation
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
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
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
On the spatiotemporal burstiness of terms
Proceedings of the VLDB Endowment
Continuous queries on trajectories of moving objects
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Stream-Mode FPGA acceleration of complex pattern trajectory querying
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Spatiotemporal objects – that is, objects that evolve over time – appear in many applications. Due to the nature of such applications, storing the evolution of objects through time in order to answer historical queries (queries that refer to past states of the evolution) requires a very large specialized database, what is termed in this article a spatiotemporal archive. Efficient processing of historical queries on spatiotemporal archives requires equally sophisticated indexing schemes. Typical spatiotemporal indexing techniques represent the objects using minimum bounding regions (MBR) extended with a temporal dimension, which are then indexed using traditional multidimensional index structures. However, rough MBR approximations introduce excessive overlap between index nodes, which deteriorates query performance. This article introduces a robust indexing scheme for answering spatiotemporal queries more efficiently. A number of algorithms and heuristics are elaborated that can be used to preprocess a spatiotemporal archive in order to produce finer object approximations, which, in combination with a multiversion index structure, will greatly improve query performance in comparison to the straightforward approaches. The proposed techniques introduce a query efficiency vs. space tradeoff that can help tune a structure according to available resources. Empirical observations for estimating the necessary amount of additional storage space required for improving query performance by a given factor are also provided. Moreover, heuristics for applying the proposed ideas in an online setting are discussed. Finally, a thorough experimental evaluation is conducted to show the merits of the proposed techniques.