Published Articles >> Table of Contents >> Abstract

2003 International Conference on Parallel Processing (ICPP'03)   p. 565
Towards Real-time Parallel Processing of Spatial Queries
Haibo Hu, The Hong Kong University of Science and Technology
Manli Zhu, The Hong Kong University of Science and Technology
Dik-Lun Lee, The Hong Kong University of Science and Technology

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2003.1240624
Send link to a friend

Abstract
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. In this paper, we investigate how multiple window queries can be parallelized, decomposed, scheduled and processed in realtime 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.
Back to Top Additional Information
Citation:  Haibo Hu, Manli Zhu, Dik-Lun Lee, "Towards Real-time Parallel Processing of Spatial Queries," icpp, p. 565,  2003 International Conference on Parallel Processing (ICPP'03),  2003