Finitely Specifiable Implicational Dependency Families
Journal of the ACM (JACM)
Properties and update semantics of consistent views
ACM Transactions on Database Systems (TODS)
Abstract and concrete categories
Abstract and concrete categories
Foundations of canonical update support for closed database views
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
Unique complements and decompositions of database schemata
Journal of Computer and System Sciences
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
Horn clauses and database dependencies
Journal of the ACM (JACM)
On the family of generalized dependency constraints
Journal of the ACM (JACM)
Updates and object-generating views in ODBS
Data & Knowledge Engineering
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Uniqueness of Update Strategies for Database Views
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
View Updates Translations in Relational Databases
DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Relational lenses: a language for updatable views
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Fibrations and universal view updatability
Theoretical Computer Science
Constant Complements, Reversibility and Universal View Updates
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
Semantics in Data and Knowledge Bases
A Model of Database Components and their Interconnection Based upon Communicating Views
Proceedings of the 2008 conference on Information Modelling and Knowledge Bases XIX
Controlled Query Evaluation and Inference-Free View Updates
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Update support for database views via cooperation
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Information-optimal reflections of view updates on relational database schemata
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A model of independence and overlap for transactions on database schemata
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
A Simple Model of Negotiation for Cooperative Updates on Database Schema Components
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Characterization of optimal complements of database views defined by projection
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Lenses, fibrations and universal translations
Mathematical Structures in Computer Science
Independent update reflections on interdependent database views
Conceptual Modelling and Its Theoretical Foundations
Information-based distance measures and the canonical reflection of view updates
Annals of Mathematics and Artificial Intelligence
FD covers and universal complements of simple projections
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Three complementary approaches to bidirectional programming
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Hi-index | 0.00 |
The fundamental problem in the design of update strategies for views of database schemata is that of selecting how the view update is to be reflected back to the base schema. This work presents a solution to this problem, based upon the dual philosophies of closed update strategies and order-based database mappings. A closed update strategy is one in which the entire set of updates exhibit natural closure properties, including transitivity and reversibility. The order-based paradigm is a natural one; most database formalisms endow the database states with a natural order structure, under which update by insertion is an increasing operation, and update by deletion is decreasing. Upon augmenting the original constant-complement strategy of Bancilhon and Spyratos – which is an early version of a closed update strategy – with compatible order-based notions, the reflection to the base schema of any update to the view schema which is an insertion, a deletion, or a modification which is realizable as a sequence of insertions and deletions is shown to be unique and independent of the choice of complement. In addition to this uniqueness characterization, the paper also develops a theory which identifies conditions under which a natural, maximal, update strategy exists for a view. This theory is then applied to a ubiquitous example – single-relational schemata constrained by equality-generating dependencies. Within this framework it is shown that for a view defined as a projection of the main relation, the only possibility is that the complement defining the update process is also a projection, and that the reconstruction is based upon functional dependencies.