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

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.