ODABA

The theoretical base for ODABA is Unified Database Theory, which defines abstract database model levels for different types of databases. ODABA combines the flexibility of key/value stores (P0) with the simplicity of relational databases (P1), the complexity of object-oriented databases (P2) and analytical features of data warehouse technologies (P3). Relational databases (entity-relationship models) are considered to be P1 database models, which store data in well-structured instances that are collected in tables. P1requirements are also fulfilled by object-oriented databases, which may store data in well-structured object instances collected in extents. This way, ODABA also supports P1requirements. Besides an instance schema, P2 database models allow storing any number of data collections (e.g. children of a person), which is typical for object-oriented databases. This also includes inverse relationships and inheritance, which also are considered as relationships. ODABA supports the requirements on object-oriented databases and is, hence, also a P2 database model. ODABA may run with or without server - no different for the application. Platform independent database format also allows using databases on different hardware platforms and running applications in heterogeneous environments. User may develop and use an ODABA application just referring to a database file on a local computer or on a shared device in a local network, which also provides concurrent access to the database. This also means that database files might simply be moved from one environment to another. ODABA supports implementing business rules for complex data types. In addition, one may also support business rules for properties. Moreover, ODABA also supports a causality model, which allows defining cause and actions by means of state transitions of object instances or properties.