Abstract
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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Vigna, S. (2004). Reachability problems in entity-relationship schema instances. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3288, 96–109. https://doi.org/10.1007/978-3-540-30464-7_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
