D-011
Integrated Group Nearest Neighbor(IGNN) Query Algorithm on Road Network Distance

○Win Tin Nilar・Htoo Htoo・Yutaka Ohsawa（Saitama Univ.）

Given a query point set Q, a target point set T, a candidate point set C and　integer k, integrated group nearest neighbor (IGNN) query finds a group nearest neighbor with the minimum aggregate distance for an integrated set that consists of the given all data sets. This paper proposes an efficient materialized centroid point (MCP) algorithm to accomplish IGNN query by centroid point approach based on simple materialized path view structure. Extensive experiments are conducted to analyze the performance of the proposed algorithm and overall experiments prove that the proposed algorithm outperforms the existing method in the processing time.