Authors: Majid Khojastehpour; S. Kami Makki; Bo Sun
Addresses: Department of Electrical Engineering and Computer Science, University of Toledo, 2801 W. Bancroft Street, Toledo, Ohio 43606, USA. ' Department of Computer Science, Lamar University, 211 Red Bird Lane, P.O. Box 10056, Beaumont, TX 77710, USA. ' Department of Computer Science, Lamar University, 211 Red Bird Lane, P.O. Box 10056, Beaumont, TX 77710, USA
Abstract: Recent technological advances in location aware, mobile and wireless devices have promoted the demand for efficient indexing structures for retrieval of information from moving objects databases. However, using existing indexing methods on data that are changing frequently will lead to serious performance overhead due to the fact that the index structure should be updated constantly which is clearly not an appropriate solution. Therefore, new methods must be utilised for moving object databases to address the indexing issue and as a result enhance the retrieval of information from these databases. This paper introduces delineated R-tree (DR-tree) indexing structure which has performance advantages over recent R-tree-based indexing structures for a number of essential operations such as read, write, node-split, and tree adjustment. DR-tree is a balanced tree, and the nodes common property is based on the principle of recursive decomposition of space without any overlap.
Keywords: delineated R-tree indexing; moving objects; mobile objects; spatio-temporal; minimum bonding rectangle; information retrieval.
International Journal of Information and Decision Sciences, 2012 Vol.4 No.2/3, pp.182 - 198
Published online: 26 May 2012 *Full-text access for editors Access for subscribers Purchase this article Comment on this article