Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Data-driven understanding and refinement of schema mappings
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Schema mediation for large-scale semantic data sharing
The VLDB Journal — The International Journal on Very Large Data Bases
Integrating Data from Disparate Sources: A Mass Collaboration Approach
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data sharing in the Hyperion peer database system
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Principles of dataspace systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reconciling while tolerating disagreement in collaborative data sharing
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Query rewriting with symmetric constraints
AI Communications
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Update exchange with mappings and provenance
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Bootstrapping pay-as-you-go data integration systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interactive source registration in community-oriented information integration
Proceedings of the VLDB Endowment
Data conflict resolution using trust mappings
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
A Simple Model of Negotiation for Cooperative Updates on Database Schema Components
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Incrementally improving dataspaces based on user feedback
Information Systems
Collaborative data sharing via update exchange and provenance
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Youtopia is a platform for collaborative management and integration of relational data. At the heart of Youtopia is an update exchange abstraction: changes to the data propagate through the system to satisfy user-specified mappings. We present a novel change propagation model that combines a deterministic chase with human intervention. The process is fundamentally cooperative and gives users significant control over how mappings are repaired. An additional advantage of our model is that mapping cycles can be permitted without compromising correctness. We investigate potential harmful interference between updates in our model; we introduce two appropriate notions of serializability that avoid such interference if enforced. The first is very general and related to classical final-state serializability; the second is more restrictive but highly practical and related to conflict-serializability. We present an algorithm to enforce the latter notion. Our algorithm is an optimistic one, and as such may sometimes require updates to be aborted. We develop techniques for reducing the number of aborts and we test these experimentally.