Performance Impact to the Applying Design Patternization Techniques to Object-Relational Databases

  • Boris SchegolevEmail author
  • Himesha Wijekoon
  • Jakub Štěpán Novák
  • Vojtěch Merunka
Conference paper
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 366)


This paper looks at performance aspects of applying object-oriented design patterns to databases mainly on the level of computational complexity. Considering selected patterns that may be applied on both application and database layer, algorithm complexity is evaluated. The authors focus on purely theoretical computational complexity of given algorithms and presents our preliminary research in this area which tries to be independent on individual database vendors and their particular implementations leading to a simple apple-to-apple comparison of the performance impact to the applying of the given patternization technique.


Object-oriented database Relational database Database performance Execution complexity Design patterns 


  1. 1.
    Abadi, M., Cardelli, L.: A Theory of Objects. Springer, New York (1998)zbMATHGoogle Scholar
  2. 2.
    Bertino, E., Martino, L.: Object-Oriented Database Systems. Addison-Wesley, Wokingham (1993)zbMATHGoogle Scholar
  3. 3.
    Black, P.E.: Big-O notation. Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology (2019). Accessed 31 Mar 2019
  4. 4.
    Chaudhuri, S.: Query optimizers: time to rethink the contract? In: Binnig, C., Dageville, B. (eds.) Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD 2009), pp. 961–968. ACM, New York (2009).
  5. 5.
    Date, C.J.: An Introduction to Database Systems. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  6. 6.
    Fontaine, D.: Mastering PostgreSQL in Application Development. (2017). ISBN 978-024494525Google Scholar
  7. 7.
    Freeman, E., Freeman, E., Sierra, K., Bates, B.: Head First Design Patterns (paperback), p. 244. O’Reilly Media, Sebastopol (2004). ISBN 978-0-596-00712-6. OCLC 809772256Google Scholar
  8. 8.
    Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software with a foreword of Grady BOOCH. Addison-Wesley Professional, Reading (1995). ISBN 978-0201633610Google Scholar
  9. 9.
    Knuth, D.: Chapter 1.2.11: Asymptotic representations. Fundamental algorithms. In: The Art of Computer Programming, vol. 1, 3rd edn. Addison-Wesley, Reading (1997). ISBN 978-0-201-89683-1Google Scholar
  10. 10.
    Gemstone: GemStone/S v6.7.1 Programming Guide, GemStone Systems, Inc. (2018)Google Scholar
  11. 11.
    Loomis, M.: ODBMS vs. relational. J. Object-Oriented Program. 3, 79–82 (1990)Google Scholar
  12. 12.
    Loomis, M.: Hitting the relational wall. J. Object-Oriented Program. 7, 56–59 (1994)Google Scholar
  13. 13.
    Taylor, R.W., Frank, R.L.: CODASYL Database Management Systems. ACM Comput. Surv. 8(1), 67–103 (1976)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Boris Schegolev
    • 1
    Email author
  • Himesha Wijekoon
    • 1
  • Jakub Štěpán Novák
    • 2
  • Vojtěch Merunka
    • 1
    • 3
  1. 1.Faculty of Economics and Management, Department of Information EngineeringCzech University of Life Sciences PraguePragueCzech Republic
  2. 2.Faculty of Economics and Management, Department of Information TechnologyCzech University of Life Sciences PraguePragueCzech Republic
  3. 3.Faculty of Nuclear Sciences and Physical Engineering, Department of Software EngineeringCzech Technical University in PraguePragueCzech Republic

Personalised recommendations