Comparing the performance of object and object relational database systems on objects of varying complexity

  • Authors:
  • Reza Kalantari;Christopher H. Bryant

  • Affiliations:
  • School of Computing, Science and Engineering, Newton Building, University of Salford, Salford, Greater Manchester, UK;School of Computing, Science and Engineering, Newton Building, University of Salford, Salford, Greater Manchester, UK

  • Venue:
  • BNCOD'10 Proceedings of the 27th British national conference on Data Security and Security Data
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.