Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A Framework for Generating Network-Based Moving Objects
Geoinformatica
IEEE Transactions on Computers
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th International Conference on Data Engineering
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
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Processing in-route nearest neighbor queries: a comparison of alternative approaches
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Reverse Nearest Neighbors in Large Graphs
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering
Continuous Reverse Nearest Neighbor Monitoring
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reverse Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
IEEE Transactions on Knowledge and 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
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Continuous Reverse k-Nearest-Neighbor Monitoring
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Continuous Reverse Nearest Neighbor Queries on Moving Objects in Road Networks
WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
Proceedings of the VLDB Endowment
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Snapshot location-based query processing on moving objects in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Reverse k Nearest Neighbor and Reverse Farthest Neighbor Search on Spatial Networks
Transactions on Large-Scale Data- and Knowledge-Centered Systems I
Lazy updates: an efficient technique to continuously monitoring reverse kNN
Proceedings of the VLDB Endowment
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Influence zone: Efficiently processing reverse k nearest neighbors queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Continuous Monitoring of Distance-Based Range Queries
IEEE Transactions on Knowledge and Data Engineering
Efficient algorithms to monitor continuous constrained k nearest neighbor queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Dynamic range query in spatial network environments
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Efficiently processing snapshot and continuous reverse k nearest neighbors queries
The VLDB Journal — The International Journal on Very Large Data Bases
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
Proceedings of the 21st ACM international conference on Information and knowledge management
Continuous maximal reverse nearest neighbor query on spatial networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
DART: an efficient method for direction-aware bichromatic reverse k nearest neighbor queries
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive toward objects and queries movement. For example, the results of a query are to be recomputed whenever the query changes its location. We present a framework for continuous reverse k nearest neighbor (RkNN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. This significantly improves the computation cost. As a byproduct, our framework also reduces the communication cost in client---server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. We also conduct a rigid cost analysis for our Euclidean space RkNN algorithm. We show that our techniques can also be applied to answer bichromatic RkNN queries in Euclidean space as well as in spatial networks. Furthermore, we show that our techniques can be extended for the spatial networks that are represented by directed graphs. The extensive experiments demonstrate that our techniques outperform the existing techniques by an order of magnitude in terms of computation cost and communication cost.