Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
IEEE Transactions on Computers
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
DEXA '01 Proceedings of the 12th International Workshop on Database and Expert Systems Applications
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Moving Objects Information Management: The Database Challenge
NGITS '02 Proceedings of the 5th International Workshop on Next Generation Information Technologies and Systems
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
On nearest neighbor indexing of nonlinear trajectories
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Motion adaptive indexing for moving continual queries over moving objects
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On Incremental Processing of Continual Range Queries for Location-Aware Services and Applications
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
Incremental Processing of Continual Range Queries over Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Monitoring Orientation of Moving Objects around Focal Points
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Probabilistic moving range query over RFID spatio-temporal data streams
Proceedings of the 18th ACM conference on Information and knowledge management
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Dynamic multiroot, multiquery processing based on data sharing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Selecting tracking principals with epoch awareness
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Ranking continuous nearest neighbors for uncertain trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
Loyalty-based selection: retrieving objects that persistently satisfy criteria
Proceedings of the 21st ACM international conference on Information and knowledge management
Continuous Location Dependent Queries in Mobile Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Private proximity testing with an untrusted server
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Hi-index | 0.00 |
This paper describes a motion-adaptive indexing scheme for efficient evaluation of moving continual queries (MCQs) over moving objects. It uses the concept of motion-sensitive bounding boxes (MSBs) to model moving objects and moving queries. These bounding boxes automatically adapt their sizes to the dynamic motion behaviors of individual objects. Instead of indexing frequently changing object positions, we index less frequently changing object and query MSBs, where updates to the bounding boxes are needed only when objects and queries move across the boundaries of their boxes. This helps decrease the number of updates to the indexes. More importantly, we use predictive query results to optimistically precalculate query results, decreasing the number of searches on the indexes. Motion-sensitive bounding boxes are used to incrementally update the predictive query results. Furthermore, we introduce the concepts of guaranteed safe radius and optimistic safe radius to extend our motion-adaptive indexing scheme to evaluating moving continual k\hbox{-}{\rm nearest\ neighbor\ }(k\rm NN) queries. Our experiments show that the proposed motion-adaptive indexing scheme is efficient for the evaluation of both moving continual range queries and moving continual k\rm NN queries.