Comparing the performance of object and object relational database systems on objects of varying complexity
Kalantari, R and Bryant, CH 2012, 'Comparing the performance of object and object relational database systems on objects of varying complexity' , in: Proceedings of the 27th British National Conference on Databases , Lecture Notes in Computer Science (6121) , Springer-Verlag, Berlin.
|PDF - Accepted Version |
Download (466kB) | Preview
This is the first published work to compare the performance of object and object relational database systems based on the object's complexity. The findings of this research show that the performance of object and object relational database systems are related to the complexity of the object in use. Object relational databases have better performance compared to object databases for fundamental database operations, with the exception of insert operations, on objects with low and medium complexity. For objects with high complexity, the object relational databases have better performance for update and delete operations.
|Item Type:||Book Section|
|Uncontrolled Keywords:||Object database, object relational database, performance, complexity.|
|Themes:||Subjects outside of the University Themes|
|Schools:||Colleges and Schools > College of Science & Technology|
Colleges and Schools > College of Science & Technology > School of Computing, Science and Engineering > Data Mining and Pattern Recognition Research Centre
|Journal or Publication Title:||Lecture Notes in Computer Science, volume 6121|
|Depositing User:||Dr Chris H. Bryant|
|Date Deposited:||11 Oct 2011 12:09|
|Last Modified:||21 Feb 2012 09:55|
Document DownloadsMore statistics for this item...
Actions (login required)
|Edit record (repository staff only)|