Title: Applying R Trees In Non Spatial Multidimensional Databases
Abstract: In this paper we propose that R trees which is a spatial access method has the ability for indexing on multiple dimensions. The traditional Database Management Systems (DBMSs) like Oracle, Mysql do not perform well when multidimensional Non Spatial data is given since these DBMSs follows one dimensional indexing at different levels and it effects the retrieval time of queries poorly has sequential scan of the database is done. R Tree families are the most efficient among the indexing structures in data accessing methods in case of spatial data The multicolumn index structure available in the present-day DBMSs follows a single dimension indexing at multiple levels. Spatial access methods like R-Trees are capable of indexing on multiple dimensions R trees have a better performance in case of spatial data. Retrieval time of queries can be improved considerably compared traditional DBMSs methods.
Publication Year: 2014
Publication Date: 2014-07-25
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot