A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Probabilistic quantifiers and games
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
On Unapproximable Versions of NP-Complete Problems
SIAM Journal on Computing
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
MYSTIQ: a system for finding more answers by using probabilities
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Trio: a system for data, uncertainty, and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Materialized views in probabilistic databases: for information exchange and query optimization
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Update exchange with mappings and provenance
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Data integration with uncertainty
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient core computation in data exchange
Journal of the ACM (JACM)
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Bootstrapping pay-as-you-go data integration systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An O(n2(m + n log n) log n) min-cost flow algorithm
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Data integration with uncertainty
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient evaluation of HAVING queries on a probabilistic database
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Proceedings of the 13th International Conference on Database Theory
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
The Max-Flow Min-Cut theorem for countable networks
Journal of Combinatorial Theory Series B
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, such as solution, universal solution, and the certain answers of target queries. We develop a framework for data exchange over probabilistic databases, and make a case for its coherence and robustness. This framework applies to arbitrary schema mappings, and finite or countably infinite probability spaces on the source and target instances. After establishing this framework and formulating the key concepts, we study the application of the framework to a concrete and practical setting where probabilistic databases are compactly encoded by means of annotations formulated over random Boolean variables. In this setting, we study the problems of testing for the existence of solutions and universal solutions, materializing such solutions, and evaluating target queries (for unions of conjunctive queries) in both the exact sense and the approximate sense. For each of the problems, we carry out a complexity analysis based on properties of the annotation, for various classes of dependencies. Finally, we show that the framework and results easily and completely generalize to allow not only the data, but also the schema mapping itself to be probabilistic.