By Topic

Towards real-time parallel processing of spatial queries

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
$31 $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

3 Author(s)
Haibo Hu ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon ; Manli Zhu ; Dik-Lun Lee

Spatial databases are entering an era of mass deployment in various real-life applications, especially mobile and location-based services. The real-time processing of spatial queries to meet different performance goals poses new problems to the real-time and parallel processing communities. We investigate how multiple window queries can be parallelized, decomposed, scheduled and processed in real time workloads to optimize system performance, such as I/O cost, response time and miss rate. We devise in-memory R-trees to decompose queries into independent jobs. Jobs from different queries can be combined according to their spatial locality to eliminate redundant I/Os. Runtime job schedulers are elaborately devised to optimize response time or miss rate for various systems. Empirical results show a significant performance improvement over the sequential, unparalleled approach

Published in:

Parallel Processing, 2003. Proceedings. 2003 International Conference on

Date of Conference:

9-9 Oct. 2003