An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
View updates in relational databases with an independent scheme
ACM Transactions on Database Systems (TODS)
An illustrated mathematical foundation for ERA
The unified computation laboratory
Updating relational databases through weak instance interfaces
ACM Transactions on Database Systems (TODS)
Categories and computer science
Categories and computer science
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Next generation database systems won't work without semantics! (panel)
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On the correct translation of update operations on relational views
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
An Introduction to Database Systems
An Introduction to Database Systems
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Implementing Queries and Updates on Universal Scheme Interfaces
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Selective Attribute Elimination for Categorial Data Specifications
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
On category theory as a (meta) ontology for information systems research
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
View Updatability Based on the Models of a Formal Specification
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Reverse Engineering Legacy Information Systems for Internet Based Interoperation
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
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
Database interoperability through state-based logical data independence
International Journal of Computer Applications in Technology
Inconsistency Management and View Updates
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.05 |
The Sketch Data Model (SkDM) is a new semantic modelling paradigm based on category theory (specifically on categorical universal algebra), which has been used successfully in several consultancies with major Australian companies. This paper describes the sketch data model and investigates the view update problem (VUP) in the sketch data model paradigm. It proposes an approach to the VUP in the SkDM, and presents a range of examples to illustrate the scope of the proposed technique. In common with previously proposed approaches, we define under what circumstances a view update can be propagated to the underlying database. Unlike many previously proposed approaches the definition is succinct and consistent, with no ad hoc exceptions, and the propagatable updates form a broad class. We argue that we avoid ad hoc exceptions by basing the definition of propagatable on the state of the underlying database. The examples demonstrate that under a range of circumstances a view schema can be shown to have propagatable views in all states, and thus state-independence can frequently be recovered.