A delineated R-tree indexing method for managing moving objects Online publication date: Sat, 09-Aug-2014
by Majid Khojastehpour; S. Kami Makki; Bo Sun
International Journal of Information and Decision Sciences (IJIDS), Vol. 4, No. 2/3, 2012
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook