Strong Types for Relational Data Stored in Databases or Spreadsheets
Abstract
Relational data stored in databases and spreadsheets often present inconsistencies. Moreover, data integrity checking in a low level programming environment, such as the one provided by spreadsheets, is error-prone. We present a strongly-typed model of relational databases and operations on them, which allows for static checking of errors and integrity at compile time. The model relies on typeclass bounded, parametric polymorphism. We demonstrate its encoding in the functional programming language Haskell. Apart from the standard relational databases operations, we formalize functional dependencies, normal forms and operations for database transformation. We also present a first approach on how to use this model to perform spreadsheet refactoring. For this purpose, we encode operations which migrate from spreadsheets to our model and vice-versa. Altogether, this model can be used to design and experiment with typed languages for modeling, programming and migrating databases.
Strong Types for Relational Data Stored in Databases or Spreadsheets
Matema´tica e Cieˆncias de Computac¸a˜o
Strong Types for Relational Data Stored
in Databases or Spreadsheets
Alexandra Martins da Silva
Supervisores:
Joost Visser
Jose´ Nuno Oliveira
Braga
2006
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime