IJTEEE
International Journal of Technology Enhancements and Emerging Engineering Research (ISSN 2347-4289)
PREVIOUS PUBLICATIONS



IJTEEE >> Volume 2 - Issue 7, July 2014 Edition



International Journal of Technology Enhancements and Emerging Engineering Research  
International Journal of Technology Enhancements and Emerging Engineering Research

Website: http://www.ijteee.org

ISSN 2347-4289



Applying R Trees In Non Spatial Multidimensional Databases

[Full Text]

 

AUTHOR(S)

Jinka Sravana , Suba. S

 

KEYWORDS

Keywords: R trees, Non spatial data, multidimensional databases, retrieval, Database Management Systems

 

ABSTRACT

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.

 

REFERENCES

[1]. A. Guttman, ―R-Trees: A Dynamic Index Structure for Spatial Searching,Proc. ACM SIGMOD ’84, pp. 47-57, 1984.

[2]. D. Greene, ―An Implementation and Performance Analysis of Spatial Data AccessMethods,Proc. Fifth IEEE Int’l Conf. Data Eng. (ICDE ’89), pp. 606-615, 1989.

[3]. K. Chakrabarti and S. Mehrotra, ―Efficient Concurrency Control in Multi-Dimensional Access Methods,Proc. ACM SIGMOD ’99, pp. 25-36, 1999.

[4]. J.K. Chen, Y.F. Huang, and Y.H. Chin, ―A Study of Concurrent Operations on R-Trees, Information Sciences, vol. 98, nos. 1-4, pp. 263- 300, May 1997.