Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
The structure of the relational database model
The structure of the relational database model
View updates in relational databases with an independent scheme
ACM Transactions on Database Systems (TODS)
Logic programming and databases
Logic programming and databases
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On interpretations of relational languages and solutions to the implied constraint problem
ACM Transactions on Database Systems (TODS)
On the correct translation of update operations on relational views
ACM Transactions on Database Systems (TODS)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
View Updates Translations in Relational Databases
DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
Updating relational databases through views (complements, mappings, select, project, join)
Updating relational databases through views (complements, mappings, select, project, join)
An Order-Based Theory of Updates for Closed Database Views
Annals of Mathematics and Artificial Intelligence
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Update support for database views via cooperation
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
Semantics in Data and Knowledge Bases
Model Suites For Multi-Layered Database Modelling
Proceedings of the 2010 conference on Information Modelling and Knowledge Bases XXI
A service-oriented approach to web warehousing
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Information-based distance measures and the canonical reflection of view updates
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
For the problem of reflecting an update on a database view to the main schema, the constant-complement strategies are precisely those which avoid all update anomalies, and so define the gold standard for well-behaved solutions to the problem. However, the families of view updates which are supported under such strategies are limited, so it is sometimes necessary to go beyond them, albeit in a systematic fashion. In this work, an investigation of such extended strategies is initiated for relational schemata. The approach is to characterize the information content of a database instance, and then require that the optimal reflection of a view update to the main schema embody the least possible change of information. To illustrate the utility of the idea, sufficient conditions for the existence of optimal insertions in the context of families of extended embedded implicational dependencies (XEIDs) are established. It is furthermore established that all such optimal insertions are equivalent up to a renaming of the new constant symbols which were introduced in support of the insertion.