'The impedance mismatch problem of using Relational Database Management Systems in statically typed object-oriented programming languages has been subject to many partial solutions, and has many facets. This project concerns the querying part of such a solution, and tries to explain deficiencies found in existing querying methods through analysis and a literature study.
The goal is to ease the querying process by designing a new querying language that integrates with the host language, and is statically checkable, has the same syntax and very similar semantics as the host language, while being modularizable and optimizable.
Through a description of the new language - Simple Object Query Language (SOQL) - and a description of how it may be translated to SQL, we argue that it fulfills most criteria. Subject to development of a compiler and surrounding framework, it could be a favorable alternative to existing solutions as it among other properties enables static checking while still being modularizable and optimizable. The language fails to retain the same semantics as Java, the differences being intricate, and in conclusion it is questionable whether SOQL makes it any easier to express queries. '