A grid-based node split algorithm for managing current location data

  • Authors:
  • Jae-Kwan Yun;Seung-Won Lee;Dong-Suk Hong;Dong-Oh Kim;Ki-Joon Han

  • Affiliations:
  • School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea

  • Venue:
  • GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

There is rapidly increasing interest in Location Based Service(LBS) which utilizes location data of moving objects. To efficiently manage the huge amounts of location data in LBS, the GALIS (Gracefully Aging Location Information System) architecture, a cluster-based distributed computing architecture, is proposed. The GALIS using the non-uniform 2-level grid algorithm performs load balancing and indexing for nodes. However, the non-uniform 2-level grid algorithm has a problem creating unnecessary nodes when moving objects are crowded in a certain area. Therefore, a new node split algorithm, which is more efficient for various distribution of moving objects, is proposed in this paper. Because the algorithm proposed in this paper considers spatial distribution for the current location of moving objects, it can perform efficient load balancing without creating unnecessary nodes even when moving objects are congested in a certain area. Besides, the various data distribution configuration for moving objects has been experimented by implementing node split simulators and it's been verified that the proposed algorithm splits nodes more efficiently than the existing algorithm.