Efficient difference NN queries for moving objects

Authors:
Bin Wang;Xiaochun Yang;Guoren Wang;Ge Yu
Affiliations:
School of Information Science and Engineering, Northeastern University, China;School of Information Science and Engineering, Northeastern University, China;School of Information Science and Engineering, Northeastern University, China;School of Information Science and Engineering, Northeastern University, China
Venue:
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
Year:
2007

Citing 17
Cited 0

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
Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications

IEEE Transactions on Parallel and Distributed Systems
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Data clustering: a review

ACM Computing Surveys (CSUR)
Outlier detection for high dimensional data

SIGMOD '01 Proceedings of the 2001 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
Performance of Nearest Neighbor Queries in R-Trees

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Constrained Nearest Neighbor Queries

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Group Nearest Neighbor Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces

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
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
Nearest and reverse nearest neighbor queries for moving objects

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group Nearest Neighbor query is a relatively prevalent application in spatial databases and overlay network. Unlike the traditional KNN queries, GNN queries maintain several query points and allow aggregate operations among them. Our paper proposes a novel approach for dealing with difference operation of GNN queries on multiple query points. Difference nearest neighbor (DNN) plays an important role on statistical analysis and engineer computation. Seldom existing approaches consider DNN queries. In our paper, we use the properties of hyperbola to efficiently solve DNN queries. A hyperbola divides the query space into several subspaces. Such properties can help us to prune the search spaces. However, the computation cost using hyperbola is not desirable since it is difficult to estimate spaces using curves. Therefore, we adopt asymptotes of hyperbola to simplify the hyperbola-based pruning strategy to reduce the computation cost and the search space. Our experimental results show that the proposed approaches can efficiently solve DNN queries.