Hits:

Indexed by:期刊论文

Date of Publication:2011-04-01

Journal:ICIC Express Letters

Included Journals:EI、Scopus

Volume:5

Issue:4 B

Page Number:1347-1352

ISSN No.:1881803X

Abstract:If the data are organized effectively in spatial networks, it is possible to reduce the cost of the aggregate network operations during query processing. So different techniques based on the clustering graph model are proposed to solve the spatial network clustering problem. However, the clustering graph model can not correctly capture the disk access costs of aggregate network operations. Thus, we propose an improved clustering approach to overcome the shortcomings of graph clustering model. The proposed approach aims to minimize the total number of disk page accesses in aggregate network operations while reducing the number of allocated disk pages as far as possible. The experimental results show that the proposed approach is very effective in reducing the number of disk accesses incurred by the network operations. ICIC International ? 2011.