Authors: Sebastiano Vigna
Tags: 2004, conceptual modeling
Recent developments in reification of ER schemata include automatic generation of web-based database administration systems [1,2]. These systems enforce the schema cardinality constraints, but, beyond unsatisfiable schemata, this feature may create unreachable instances. We prove sound and complete characterisations of schemata whose instances satisfy suitable reachability properties; these theorems translate into linear algorithms that can be used to prevent the administrator from reifying schemata with unreachable instances.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-540-30464-7_9
