Survey of graph database models
R Angles, C Gutierrez - ACM Computing Surveys (CSUR), 2008 - dl.acm.org
Graph database models can be defined as those in which data structures for the schema
and instances are modeled as graphs or generalizations of them, and data manipulation is …
and instances are modeled as graphs or generalizations of them, and data manipulation is …
Fundamentals of cardinality constraints
B Thalheim - International Conference on Conceptual Modeling, 1992 - Springer
Abstract The Entity-Relationship model is frequently used during conceptual database
design phases. However, this model can be enriched and then used for the complete …
design phases. However, this model can be enriched and then used for the complete …
[PDF][PDF] Fundamental concepts of object oriented databases
KD Schewe, B Thalheim - Acta Cybernetica, 1993 - cyber.bibl.u-szeged.hu
Fundamental Concepts of Object Oriented Databases Page 1 Acta Cybernetics Vol. 11, No.
1-2, Szeged, 1993 Fundamental Concepts of Object Oriented Databases K.-D. Schewe* B …
1-2, Szeged, 1993 Fundamental Concepts of Object Oriented Databases K.-D. Schewe* B …
Foundations of entity-relationship modeling
B Thalheim - Annals of Mathematics and Artificial Intelligence, 1993 - Springer
Database design methodologies should facilitate database modeling, effectively support
database processing, and transform a conceptual schema of the database to a high …
database processing, and transform a conceptual schema of the database to a high …
[HTML][HTML] On the data complexity of consistent query answering over graph databases
P Barceló, G Fontaine - Journal of Computer and System Sciences, 2017 - Elsevier
Applications of graph databases are prone to inconsistency due to interoperability issues.
This raises the need for studying query answering over inconsistent graph databases in a …
This raises the need for studying query answering over inconsistent graph databases in a …
Towards a theory of consistency enforcement
KD Schewe, B Thalheim - Acta informatica, 1999 - Springer
State oriented specifications with invariants occur in almost all formal specification
languages. Hence the problem is to prove the consistency of the specified operations with …
languages. Hence the problem is to prove the consistency of the specified operations with …
A review of repairing techniques for integrity maintenance
P Fraternali, S Paraboschi - Rules in Database Systems: Proceedings of …, 1994 - Springer
In this paper we review the research on integrity enforcement in database systems. Integrity
enforcement is the task of ensuring that a user transaction applied to a legal database state …
enforcement is the task of ensuring that a user transaction applied to a legal database state …
On the generation of object databases using booster
This paper shows how ideas from a combination of formal techniques can be used to enable
the automatic generation of databases from precise object models. It explores how the …
the automatic generation of databases from precise object models. It explores how the …
Consistency enforcement in databases
S Link - International Workshop on Semantics in Databases, 2001 - Springer
Consistency enforcement aims at systematically modifying a database program such that the
result is consistent with respect to a specified set of integrity constraints. This modification …
result is consistent with respect to a specified set of integrity constraints. This modification …
An arithmetic theory of consistency enforcement
Consistency enforcement starts from a given program specification S and a static invariant I
and aims to replace S by a slightly modified program specification SI that is provably …
and aims to replace S by a slightly modified program specification SI that is provably …