Abstract
With the enormous growth of wireless technology, and location acquisition techniques, a huge amount of spatio-temporal traces are being accumulated. This dataset facilitates varied location-aware services and helps to take real-life decisions. Efficiently handling and processing spatio-temporal queries are necessary to respond in real-time. Processing the vast spatio-temporal data requires scalable computing infrastructure. In this regard, an efficient query resolution system can be deployed if we predict the infrastructure requirement of the user query apriori along with the identification of the geospatial service chain. In this work, we propose a framework, namely <i>LYRIC</i> (dead <u>L</u> ine and budget aware spatio-temporal quer <u>Y</u> p <u>R</u> ocessing <u>I</u> n <u>C</u> loud), where the spatio-temporal queries are resolved efficiently considering user-defined deadline and budget constraint. Our framework shows high deadline completion accuracy in the range of 1.0 - 0.937, which is more accurate than SparkGIS, GeoSpark, GeoMesa and JUST. This also reduces the resource prediction error by 11 percent, considering the geospatial service chain than without it. The cost of the spatio-temporal query is reduced by <inline-formula><tex-math notation="LaTeX">$\approx$</tex-math></inline-formula> 23% in LYRIC, further, the simulation study (using CloudSim) illustrates the efficacy and scalability of LYRIC in terms of optimal budget usage and execution time compared to four baseline approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.