Abstract
Indexes are needed in order to index a number of moving object’s positions to provide answers to different types of queries as fast as possible. The most popular types of querying techniques in moving object databases are K-Nearest Neighbor and Rang queries. In KNN, a set of k points of interest that can be reached in a minimum response time are retrieved. For Range Query, all objects whose positions fall within a predefined rectangular or circular range are retrieved. Creating an efficient index for objects’ locations is looked upon as the most critical problem in connection with spatial–temporal data management. Indexes are different based on their structures, query processing, and update performance. In this context, this paper aims to hybridize both tree and grid based structures to enhance update, search, and insert in the index. To achieve this goal, the current paper will discuss the design of the proposed index.
Similar content being viewed by others
References
Choi, W., Moon, B., & Lee, S. (2004). Adaptive cell-based index for moving objects. Data & Knowledge Engineering, 48(1), 75–101.
Sidlauskas, D., Saltenis, S., & Jensen, C. S. (2014). Processing of extreme moving-object update and query workloads in main memory. The VLDB Journal The VLDB Journal: The International Journal on Very Large Data Bases, 23(5), 817–841.
Tao, Y., Papadias, D., & Sun, J. (2003). The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In Proceedings of the 29th international conference on very large data bases-Volume 29 (pp. 790–801). VLDB Endowment.
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990). The R*-tree: An efficient and robust access method for points and rectangles. In Acm Sigmod record (Vol. 19, pp. 322–331, Vol. 2). ACM.
Mokbel, M. F., Ghanem, T. M., & Aref, W. G. (2003). Spatio-temporal access methods. IEEE Data Engineering Bulletin, 26(2), 40–49.
Nguyen-Dinh, L.-V., Aref, W. G., & Mokbel, M. (2010). Spatio-temporal access methods: Part 2 (2003–2010).
Chen, S., Jensen, C. S., & Lin, D. (2008). A benchmark for evaluating moving object indexes. Proceedings of the VLDB Endowment, 1(2), 1574–1585.
Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Paper presented at the proceedings of the 1984 ACM SIGMOD international conference on Management of data, Boston, Massachusetts.
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A. N., & Theodoridis, Y. (2010). R-trees: Theory and applications. Berlin: Springer.
Xia, Y., & Prabhakar, S. (2003). Q+Rtree: Efficient indexing for moving object databases. In Eighth international conference on database systems for advanced applications (DASFAA 2003). Proceedings (pp. 175–182). IEEE.
Jensen, C. S., Lin, D., & Ooi, B. C. (2004). Query and update efficient B+-tree based indexing of moving objects. In Proceedings of the thirtieth international conference on very large data bases-Volume 30 (pp. 768–779). VLDB Endowment.
Gui-juna, Y., & Ji-xianb, Z. (2005). A dynamic index structure for spatial database querying based on R-trees. In Proceedings of international symposium on spatio-temporal modeling, spatial reasoning, analysis, data mining and data fusion (pp. 27–29).
Šidlauskas, D., Šaltenis, S., Christiansen, C. W., Johansen, J. M., & Šaulys, D. (2009). Trees or grids?: Indexing moving objects in main memory. In Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems (pp. 236–245). ACM.
Xu, X., Xiong, L., & Sunderam, V. (2016). D-grid: An in-memory dual space grid index for moving object databases. In 17th IEEE international conference on mobile data management (MDM) (Vol. 1, pp. 252–261). IEEE.
Zhang, W., Li, J., & Pan, H. (2006). Processing continuous k-nearest neighbor queries in location-dependent application. International Journal of Computer Science and Network Security, 6(3), 1–9.
Šidlauskas, D., Ross, K., Jensen, C., & Šaltenis, S. (2011). Thread-level parallel indexing of update intensive moving-object workloads. In Advances in spatial and temporal databases (pp. 186–204).
Šidlauskas, D., Šaltenis, S., & Jensen, C. S. (2012). Parallel main-memory indexing for moving-object query and update workloads. In Proceedings of the 2012 ACM SIGMOD international conference on management of data (pp. 37–48). ACM.
Xiong, X., Mokbel, M. F., & Aref, W. G. (2006). LUGrid: Update-tolerant grid-based indexing for moving objects. In 7th international conference on mobile data management. MDM 2006 (pp. 13–13). IEEE.
Brinkhoff, T. (2002). A framework for generating network-based moving objects. GeoInformatica, 6(2), 153–180.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rslan, E., Abdelhameed, H. & Ezzat, E. An efficient hybridized index technique for moving object database. Spat. Inf. Res. 26, 551–561 (2018). https://doi.org/10.1007/s41324-018-0198-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41324-018-0198-7