New upper bounds for neighbor searching
Information and Control
Filtering search: a new approach to query answering
SIAM Journal on Computing
A balanced search tree with O(1) worst case update time
Acta Informatica
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
B-trees with lazy parent split
Information Sciences—Informatics and Computer Science: An International Journal
A constant update time finger search tree
Information Processing Letters
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
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)
Advanced database indexing
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
ACM Computing Surveys (CSUR)
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Indexing Mobile Objects on the Plane
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient processing of past-future spatiotemporal queries
Proceedings of the 2006 ACM symposium on Applied computing
On past-time indexing of moving objects
Journal of Systems and Software
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The power of geometric duality
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An experimental performance comparison for indexing mobile objects on the plane
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
International Journal of Organizational and Collective Intelligence
Hi-index | 0.00 |
We present a set of time-efficient approaches to index objects moving on the plane to efficiently answer range queries about their future positions. Our algorithms are based on previously described solutions as well as on the employment of efficient data structures. Finally, an experimental evaluation is included that shows the performance, scalability and efficiency of our methods.