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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
IEEE Transactions on Computers
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
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
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 6th international conference on Mobile data management
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
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
Supporting frequent updates in R-trees: a bottom-up approach
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
Tracking Nearest Surrounders in Moving Object Environments
PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
An overview of the challenges and progress in meeting the E-911 requirement for location service
IEEE Communications Magazine
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
This paper presents ''Round-Eye'', a system for tracking nearest surrounding objects (or nearest surrounders) in moving object environments. This system provides a platform for surveillance applications. The core part of this system is continuous nearest surrounder (NS) query that maintains views of the nearest objects at distinct angles from query points. This query differs from conventional spatial queries such as range queries and nearest neighbor queries as NS query considers both distance and angular aspects of objects with respect to a query point at the same time. In our system framework, a centralized server is dedicated (1) to collect location updates of both objects and queries, (2) to determine which NS queries are invalidated in presence of object/query location changes and corresponding result changes if any, and (3) to refresh the affected query answers. To enhance the system performance in terms of processing time and network bandwidth consumption, we propose various techniques, namely, safe region, partial query reevaluation, and incremental query result update. Through simulations, we evaluate our system with the proposed techniques over a wide range of settings.