An Experimental Performance Comparison for Indexing Mobile Objects on the Plane

We present a time-efficient approach to index objects moving on the plane to efficiently 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 umin in some range [umin, umax], where umin is a positive lower threshold. Our algorithm enhances a previously described solution [18] by accommodating the ISB-tree access method as presented in [6]. Experimental evaluation shows the improved performance, scalability and efficiency of the new algorithm. Categories and Subject Descriptors H.2 [Database Management]: [Emergent Systems] General Terms Algorithms, Data Structures and Indexing, Experimentation Keywords Spatio-Temporal and Multimedia Databases, Data and Knowledge Management Systems

• Type: Journal
• Year: 2010
• Where: IJOCI
• Authors: Spyros Sioutas, George Papaloukopoulos, Kostas Tsichlas, Yannis Manolopoulos
• Keywords: IJOCI 2010, Non Small Velocity, Positive Lower Threshold, Velocity Value Distribution