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
PODS '99 Proceedings of the eighteenth 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
Introduction to constraint databases
Introduction to constraint databases
On moving object queries: (extended abstract)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Selectivity estimation for spatio-temporal queries to moving objects
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Introduction to Algorithms
On the Generation of Time-Evolving Regional Data
Geoinformatica
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Temporal and spatio-temporal aggregations over data streams using multiple time granularities
Information Systems - Special issue: Best papers from EDBT 2002
Indexing Mobile Objects on the Plane
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
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
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Max-Count Aggregation Estimation for Moving Points
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Techniques for Efficient Road-Network-Based Tracking of Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Trajectory Indexing Using Movement Constraints
Geoinformatica
Efficient Rectangle Indexing Algorithms Based on Point Dominance
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Aggregation Estimation for 2D Moving Points
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Moving Objects Databases (The Morgan Kaufmann Series in Data Management Systems) (The Morgan Kaufmann Series in Data Management Systems)
Software verification and spatiotemporal aggregation in constraint databases
Software verification and spatiotemporal aggregation in constraint databases
Temporal Data Classification Using Linear Classifiers
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
A comparison of abstract data type and constraint database approaches to GIS query languages
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Classification integration and reclassification using constraint databases
Artificial Intelligence in Medicine
Temporal data classification using linear classifiers
Information Systems
Efficient traffic crash and snow complaint GIS system
Proceedings of the 12th Annual International Digital Government Research Conference: Digital Government Innovation in Challenging Times
| Hi-index | 0.01 |
Calculating operators of continuously moving objects presents some unique challenges, especially when the operators involve aggregation or the concept of congestion, which happens when the number of moving objects in a changing or dynamic query space exceeds some threshold value. This paper presents the following six d-dimensional moving object operators: (1) MaxCount (or MinCount), which finds the Maximum (or Minimum) number of moving objects simultaneously present in the dynamic query space at any time during the query time interval. (2) CountRange, which finds a count of point objects whose trajectories intersect the dynamic query space during the query time interval. (3) ThresholdRange, which finds the set of time intervals during which the dynamic query space is congested. (4) ThresholdSum, which finds the total length of all the time intervals during which the dynamic query space is congested. (5) ThresholdCount, which finds the number of disjoint time intervals during which the dynamic query space is congested. And (6) ThresholdAverage, which finds the average length of time of all the time intervals when the dynamic query space is congested. For these operators separate algorithms are given to find only estimate or only precise values. Experimental results from more than 7,500 queries indicate that the estimation algorithms produce fast, efficient results with error under 5%.