Paper Info
Title
A New Spatial Index Structure for Efficient Query Processing in Location Based Services
Abstract
The interests of Location Based Services (LBS) have been highly increased according to the development of location aware techniques and mobile devices. Various spatial-indexing methods based on R-tree structure have been proposed to process queries efficiently. However, many node accesses occur in tree based spatial index structures when queries are processed. In this paper, we propose a spatial index structure, called ISGrid that provides better efficient query processing than R-tree based index structures. ISGrid uses not a tree structure but a grid structure that provides direct accesses to data pages and uses Minimum Boundary Rectangle (MBR) as a leaf node. The grid structure is used to access the leaf node. In addition, each leaf nodes maintain the links to neighbor leaf nodes like B+-tree to avoid unnecessary parent node accesses to search a neighbor node. We show the superiority of ISGrid from performance evaluation.
Year
DOI
Venue
2010
10.1109/SUTC.2010.64
SUTC/UMC
Keywords
Field
DocType
neighbor node,voronoi diagram,efficient query processing,new spatial index structure,r-tree structure,index structure,node access,neighbor leaf node,unnecessary parent node access,location based services,moving objects,tree structure,spatial database,spatial index structure,grid structure,leaf node,index,computer networks,mobile computing,computer science,pervasive computing,grid computing,mobile communication,information technology
Mobile computing,Data mining,Grid computing,Computer science,Tree (data structure),Computer network,Location-based service,Tree structure,Mobile telephony,Spatial database,Grid
Conference
ISBN
Citations 
PageRank 
978-1-4244-7087-7
3
0.43
References 
Authors
5
8
Name
Order
Citations
PageRank
Yonghun Park1204.33
Dongmin Seo24910.64
Jong-Tae Lim347360.54
Jinju Lee430.76
Mikyoung Kim5231.67
Weiwei Bao630.43
Christopher T. Ryu7131.45
Jaesoo Yoo812335.63