Skip to the content

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.

[img]
Preview
PDF - Accepted Version
Download (478kB) | Preview

Abstract

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
Editors: MacKinnon, L
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
Publisher: Springer-Verlag
Refereed: Yes
Series Name: Lecture Notes in Computer Science
ISBN: 978-3-642-25703-2
Related URLs:
Depositing User: Dr Chris H. Bryant
Date Deposited: 11 Oct 2011 11:09
Last Modified: 20 Aug 2013 17:03
URI: http://usir.eprints.org/id/eprint/17028

Actions (login required)

Edit record (repository staff only) Edit record (repository staff only)

Downloads

Downloads per month over past year