The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Incremental and decremental evaluation of transitive closure by first-order queries
Information and Computation
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data model and data structures for moving objects databases
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)
Data Structures and Algorithm Analysis in C++
Data Structures and Algorithm Analysis in C++
Computational Geometry in C
Constraint Databases
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
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
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Spatiotemporal Model and Language for Moving Objects on Road Networks
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Moving Objects: Logical Relationships and Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Geometric Framework for Specifying Spatiotemporal Objects
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
Adaptive index management for future location-based queries
Journal of Systems and Software
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 6th international conference on Mobile data management
Dynamic histograms for future spatiotemporal range predicates
Information Sciences—Informatics and Computer Science: An International Journal
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous Skyline Queries for Moving Objects
IEEE Transactions on Knowledge and Data Engineering
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
Predictive Indexing for Position Data of Moving Objects in the Real World
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
QUESTO: A Query Language for Uncertain and Exact Spatio-temporal Objects
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Efficient MaxCount and threshold operators of moving objects
Geoinformatica
Dynamic histograms for future spatiotemporal range predicates
Information Sciences: an International Journal
Querying trajectories using flexible patterns
Proceedings of the 13th International Conference on Extending Database Technology
The vehicle tracking system for analyzing transportation vehicle information
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Mining mobile group patterns: a trajectory-based approach
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Predictive indexing for position data of moving objects in the real world
Transactions on Computational Science VI
Stream-Mode FPGA acceleration of complex pattern trajectory querying
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Service-oriented middleware for large-scale mobile participatory sensing
Pervasive and Mobile Computing
Hi-index | 0.00 |
Database applications for moving objects pose new challenges in modeling, querying, and maintenance of objects whose locations are rapidly changing over time. Previous work on modeling and querying spatio-temporal databases and constraint databases focus primarily on snapshots of changing databases. In this paper we study query evaluation techniques for moving object databases where moving objects are being updated frequently. We consider a constraint database approach to moving objects and queries. We classify moving object queries into: "past", "continuing", and "future" queries. We argue that while traditional constraint query evaluation techniques are suitable for past queries, new techniques are needed for continuing and future queries. Motivated by nearest-neighbor queries, we define a query language based on a single "generalized distance" function f mapping from objects to continuous functions from time to ℝ. Queries in this language may be past, continuing, or future. We show that if f maps to polynomials, queries can be evaluated efficiently using the plane sweeping technique from computational geometry. Consequently, many known distance based queries can be evaluated efficiently.