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

Authors:
Dong-Suk Hong;Hong-Koo Kang;Dong-Oh Kim;Jae-Kwan Yun;Ki-Joon Han
Affiliations:
School of Computer Science and Engineering, Konkuk University, Seoul, Korea 143-701;School of Computer Science and Engineering, Konkuk University, Seoul, Korea 143-701;School of Computer Science and Engineering, Konkuk University, Seoul, Korea 143-701;Digital Home Research Division, ETRI, Daejeon, Korea 305-700;School of Computer Science and Engineering, Konkuk University, Seoul, Korea 143-701
Venue:
The Journal of Supercomputing
Year:
2007

Citing 3
Cited 0

Text classification using string kernels

The Journal of Machine Learning Research
A recursive MISD architecture for pattern matching

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
RNA string kernels for RNAi off-target evaluation

International Journal of Bioinformatics Research and Applications

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 region. 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 region. 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 can split nodes more efficiently than the existing algorithm.