Affiliation:
1. Ionian University, Greece
2. University of Patras, Greece
3. Aristotle University of Thessaloniki, Greece
Abstract
In this paper, the authors present a time-efficient approach to index objects moving on the plane in order to answer range queries about their future positions. Each object is moving with non small velocity u, meaning that the velocity value distribution is skewed (Zipf) towards in some range , where is a positive lower threshold. This algorithm enhances a previously described solution (Sioutas, Tsakalidis, Tsichlas, Makris, & Manolopoulos, 2007) by accommodating the ISB-tree access method as presented in Kaporis et al. (2005). Experimental evaluation shows the improved performance, scalability, and efficiency of the new algorithm.
Reference20 articles.
1. Agarwal, P. K., Arge, L., & Erickson, J. (2000). Indexing moving points. In Proceedings of 19th symposium on principles of database systems (pp. 175-186). New York: ACM.
2. Andersson, A., & Mattsson, C. (1993). Dynamic interpolation search in o(log log n) time. In Proceedings of 20th international colloquium on automata, languages and programming (pp. 15-27). New York: Springer.
3. The R*-tree: an efficient and robust access method for points and rectangles
4. Multidimensional access methods
5. Kaporis, A., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K., & Zaroliagis, C. (2003). Improved bounds for finger search on a ram. In Proceedings of 12th annual european symposium on algorithms (pp. 325-336). New York: Springer.