2009 IEEE 25th International Conference on Data Engineering (2009)

Mar. 29, 2009 to Apr. 2, 2009

ISSN: 1084-4627

ISBN: 978-0-7695-3545-6

pp: 1144-1147

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2009.186

ABSTRACT

Given a data point set D, a query point set Q and an integer k, the Group Nearest Group (GNG) query finds a subset of points from D, ω (|ω| ≤ k), such that the total distance from all points in Q to the nearest point in ω is no greater than any other subset of points in D, ω(|ω| ≤ k). GNG query can be found in many real applications. In this paper, Exhaustive Hierarchical Combination algorithm (EHC) and Subset Hierarchial Refinement algorithm (SHR) are developed for GNG query processing. The superiority of SHR in terms of efficiency and quality compared to existing algorithms developed originally for data clustering is demonstrated.

INDEX TERMS

CITATION

H. T. Shen, K. Deng, H. Xu, G. P. Fung, S. Sadiq and Y. Lu, "Processing Group Nearest Group Query,"

*2009 IEEE 25th International Conference on Data Engineering(ICDE)*, vol. 00, no. , pp. 1144-1147, 2009.

doi:10.1109/ICDE.2009.186