By Topic

An Effective Clustering-Based Prefetching Scheme for Spatial Databases System

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

2 Author(s)
Huichao Mi ; Coll. of Comput. & Inf. Eng., Henan Univ. of Econ. & Laws, Zhengzhou, China ; Yongqiang Yang

Because of the characteristics of web spatial databases, restrictions on the applications of web spatial databases focus on accessing speed. The main solution for improving accessing speed is caching and prefetching. The existing prefetching schemes prefetch future spatial objects based on the distances of spatial locations rather than accessing contents. For the improvement of the accuracy of prefetching, we propose a clustering algorithm-clust Voronoi, which based on the web user logs. And then, we apply clust Voronoi to the prefetching scheme, named clust Pref. This prefetching scheme can automatically determine the number of clusters and give the real case of spatial databases accessing. Through a simulation environment, using a real data set, we draw a conclusion that this prefetch scheme can effectively improve the spatial databases accessing performance.

Published in:

2012 Sixth International Conference on Internet Computing for Science and Engineering

Date of Conference:

21-23 April 2012