Journal of the ACM (JACM)
Data models, database languages and database management systems
Data models, database languages and database management systems
Unique complements and decompositions of database schemata
Journal of Computer and System Sciences
A methodological framework for data warehouse design
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Making views self-maintainable for data warehousing
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Database System Concepts
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On complementary and independent mappings on databases
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Lineage Tracing for General Data Warehouse Transformations
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Maintenance of Temporal Data Warehouses
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Monotonic complements for independent data warehouses
The VLDB Journal — The International Journal on Very Large Data Bases
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Annotation propagation revisited for key preserving views
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Model management 2.0: manipulating richer mappings
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Bidirectionalization transformation based on automatic derivation of view complement functions
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Updating recursive XML views of relations
Journal of Computer Science and Technology
The view update problem for XML
Proceedings of the 2010 EDBT/ICDT Workshops
Query and update through XML views
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
A quantum interpretation of the view-update problem
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Bidirectionalizing graph transformations
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Updating XML views and querying XML views with update syntax
International Journal of Computational Science and Engineering
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
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
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
Supporting feature model refinement with updatable view
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.02 |
Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments where data is updated, not only information provided by views, but also information provided by data sources yet missing from views turns out to be relevant: Previously, this missing information has been characterized in terms of view complements; recently, it has been shown that view complements can be exploited in the context of data warehouses to guarantee desirable warehouse properties such as independence and self-maintainability. As the complete source information is a trivial complement for any view, a natural interest for "small" or even "minimal" complements arises. However, the computation of minimal complements is still not very well understood. In this article, it is shown how to compute reasonably small (and in special cases even minimal) complements for a large class of relational views.