A delineated R-tree indexing method for managing moving objects

Majid Khojastehpour, S. Kami Makki and Bo Sun

International Journal of Information and Decision Sciences, 2012, vol. 4, issue 2/3, 182-198

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. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47072 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijidsc:v:4:y:2012:i:2/3:p:182-198

Access Statistics for this article

More articles in International Journal of Information and Decision Sciences from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().