By Topic

A New Spatial Index Structure for Efficient Query Processing in Location Based Services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

8 Author(s)
Yonghun Park ; Inf. & Commun. Eng., Chungbuk Nat. Univ., Cheongju, South Korea ; Dongmin Seo ; Jongtae Lim ; Jinju Lee
more authors

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.

Published in:

Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC), 2010 IEEE International Conference on

Date of Conference:

7-9 June 2010