Title :
Processing Group Nearest Group Query
Author :
Deng, Ke ; Xu, Hu ; Sadiq, Shazia ; Lu, Yansheng ; Fung, Gabriel Pui Cheong ; Shen, Heng Tao
Author_Institution :
Univ. of Queensland, QLD
fDate :
March 29 2009-April 2 2009
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, omega (|omega| les k), such that the total distance from all points in Q to the nearest point in omega is no greater than any other subset of points in D, omega(|omega| les k). GNG query can be found in many real applications. In this paper, exhaustive hierarchical combination algorithm (EHC) and subset hierarchical 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.
Keywords :
query processing; tree data structures; R-tree; data clustering; exhaustive hierarchical combination algorithm; group nearest group query processing; subset hierarchical refinement algorithm; Aggregates; Clustering algorithms; Costs; Data engineering; Decision support systems; Euclidean distance; Meeting planning; Nearest neighbor searches; Query processing; Teleconferencing;
Conference_Titel :
Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3422-0
Electronic_ISBN :
1084-4627
DOI :
10.1109/ICDE.2009.186
