Non-Relational Schemas and Constraints in a PolyDBMS (Master Thesis, Ongoing)
Author
Description
Polypheny already supports multiple data models, making it a highly flexible system for diverse data science and database applications. However, managing schemas and constraints within non-relational data models – such as document and labeled property graph – can currently be challenging, as these models often lack explicit schema and constraint definitions.
The goal of this project is to enable the explicit definition of schemas and constraints for entities in both document and graph namespaces. This will involve implementing mechanisms for specifying structured schemas, along with developing a suitable constraint model, such as non-relational (check) constraints, that ensure data integrity across non- relational data.
In addition to schema and constraint support, the candidate will investigate advanced partitioning strategies designed to leverage schema information for improved data storage efficiency and query performance. One example of such a strategy could involve storing explicitly defined columns of non-relational entities within relational databases to optimize access and query efficiency.
Depending on the project’s progression, the candidate may also enhance mapping strategies between the models, further strengthening the interoperability and flexibility of Polypheny.
Start / End Dates
2025/02/06 - 2025/01/12