Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Information Systems 33 (2008) 117 Clustering spatial networks for aggregate query processing

Summary: Information Systems 33 (2008) 1≠17
Clustering spatial networks for aggregate query processing:
A hypergraph approach$
Engin Demir, Cevdet Aykanat√, B. Barla Cambazoglu
Computer Engineering Department, Bilkent University, 06800 Bilkent, Ankara, Turkey
Received 9 January 2006; received in revised form 29 September 2006; accepted 3 April 2007
Recommended by N. Koudas
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses
made by the aggregate network operations during query processing. For this purpose, different techniques based on the
clustering graph model are proposed in the literature. In this work, we show that the state-of-the-art clustering graph
model is not able to correctly capture the disk access costs of aggregate network operations. Moreover, we propose a novel
clustering hypergraph model that correctly captures the disk access costs of these operations. The proposed model aims to
minimize the total number of disk page accesses in aggregate network operations. Based on this model, we further propose
two adaptive recursive bipartitioning schemes to reduce the number of allocated disk pages while trying to minimize the
number of disk page accesses. We evaluate our clustering hypergraph model and recursive bipartitioning schemes on a
wide range of road network datasets. The results of the conducted experiments show that the proposed model is quite
effective in reducing the number of disk accesses incurred by the network operations.
r 2007 Elsevier B.V. All rights reserved.
Keywords: Spatial networks; Clustering; Record-to-page allocation; Hypergraph partitioning


Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University


Collections: Computer Technologies and Information Sciences