Processing Continuous Range Queries with Non-spatial Selections
In this paper, we explore the problem of scalable evaluation of Continuous Range Queries (CRQs) with non-spatial selections, each of which continually retrieves the moving objects that (i) are currently within a specified spatial query region and (ii) satisfy specified non-spatial selections. We propose a new query indexing structure, called the Bit-vector Query Region tree (BQR-tree), which enables the server to cooperate with moving objects for evaluation of CRQs with non-spatial selections. Through simulations, we verify the efficiency of the BQR-tree.
KeywordsContinuous range queries moving objects index structures
Unable to display preview. Download preview PDF.
- 2.Hu, H., Xu, J., Lee, D.: A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects. In: Proc. of ACM SIGMOD, pp. 479–490 (2005)Google Scholar
- 4.Jung, H., Kim, Y.S., Chung, Y.D.: SPQI: An Efficient Index for Continuous Range Queries in Mobile Environments. Journal of Information Science and Engineering 29(3), 557–568 (2013)Google Scholar