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
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
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)
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
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
IEEE Transactions on Knowledge and Data Engineering
Monitoring k-Nearest Neighbor Queries over Moving Objects
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
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
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
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Incremental rank updates for moving query points
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
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
Spatio-temporal database research at the University of Melbourne
ACM SIGMOD Record
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal — The International Journal on Very Large Data Bases
A motion-aware approach for efficient evaluation of continuous queries on 3D object databases
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
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Time constrained range search queries over moving objects in road networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
wNeighbors: a method for finding k nearest neighbors in weighted regions
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
MRQSim: a moving range query simulation platform in spatial networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
Shared execution strategy for neighbor-based pattern mining requests over streaming windows
ACM Transactions on Database Systems (TODS)
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
DuoWave: Mitigating the curse of dimensionality for uncertain data
Data & Knowledge Engineering
A grid-based index and queries for large-scale geo-tagged video collections
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Boosting moving object indexing through velocity partitioning
Proceedings of the VLDB Endowment
Efficient safe-region construction for moving top-K spatial keyword queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Authentication of moving range queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Towards building a high performance spatial query system for large scale medical imaging data
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Moving spatial keyword queries: Formulation, methods, and analysis
ACM Transactions on Database Systems (TODS)
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
A safe zone based approach for monitoring moving skyline queries
Proceedings of the 16th International Conference on Extending Database Technology
Optimal k-constraint coverage queries on spatial objects
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Frontiers of Computer Science: Selected Publications from Chinese Universities
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
CALBA: capacity-aware location-based advertising in temporary social networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A framework of traveling companion discovery on trajectory data streams
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
The moving k nearest neighbor (MkNN) query finds the k nearest neighbors of a moving query point continuously. The high potential of reducing the query processing cost as well as the large spectrum of associated applications have attracted considerable attention to this query type from the database community. This paper presents an incremental safe-region-based technique for answering MkNN queries, called the V*-Diagram. In general, a safe region is a set of points where the query point can move without changing the query answer. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the current knowledge of the query point and the search space in addition to the data objects. As a result, the V*-Diagram has much smaller IO and computation costs than existing methods. The experimental results show that the V*-Diagram outperforms the best existing technique by two orders of magnitude.