SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
IEEE Transactions on Computers
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Semantic Caching in Location-Dependent Query Processing
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
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
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
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
ACM SIGMOBILE Mobile Computing and Communications Review
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient proximity detection among mobile targets with dead reckoning
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Efficient k-nearest-neighbor search algorthims for historical moving object trajectories
Journal of Computer Science and Technology
Extending the LBS-framework TraX: Efficient proximity detection with dead reckoning
Computer Communications
Efficiently Monitoring Nearest Neighbors to a Moving Object
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Efficient clique detection among mobile targets
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Adaptive Safe Regions for Continuous Spatial Queries over Moving Objects
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Localized monitoring of kNN queries in wireless sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
Minimizing the communication cost for continuous skyline maintenance
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Lazy updates: an efficient technique to continuously monitoring reverse kNN
Proceedings of the VLDB Endowment
Efficient algorithms for historical continuous kNN query processing over moving object trajectories
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Continuous spatial assignment of moving users
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous medoid queries over moving objects
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient proximity detection among mobile users via self-tuning policies
Proceedings of the VLDB Endowment
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Efficient location updates for continuous queries over moving objects
Journal of Computer Science and Technology
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
BFPkNN: an efficient k-nearest-neighbor search algorithm for historical moving object trajectories
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
Leveraging computation sharing and parallel processing in location-dependent query processing
The Journal of Supercomputing
A P2P technique for continuous k-nearest-neighbor query in road networks
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
A filter-based protocol for continuous queries over imprecise location data
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient proximity detection among mobile objects in road networks with self-adjustment methods
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naïve solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm for the continuous monitoring of nearest neighbors that minimizes the communication overhead between the server and the data objects. The proposed method can be used with multiple, static, or moving queries, for any distance definition, and does not require additional knowledge (e.g., velocity vectors) besides object locations.