Probabilistic data exchange

ACM International Conference Proceeding Series

Volumn , Issue , 2010, Pages 76-88

  Fagin, Ronald ^a   Kimelfeld, Benny ^a   Kolaitis, Phokion G ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

certain answer; computational complexity; conjunctive query; data exchange; data integration; probabilistic database; probabilistic schema mapping; probabilistic solution; universal probabilistic solution

Indexed keywords

CERTAIN ANSWERS; CONJUNCTIVE QUERIES; DATA EXCHANGE; DATA INTEGRATION; PROBABILISTIC DATABASE; PROBABILISTIC SOLUTION; SCHEMA MAPPINGS;

DATA HANDLING; MAPPING; QUERY LANGUAGES; RANDOM VARIABLES; TARGETS;

COMPUTATIONAL COMPLEXITY;

EID: 77954473540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1804669.1804681     Document Type: Conference Paper

References (49)

1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In EDBT, pages 1059-1068. ACM, 2006.
2. P. Agrawal, O. Benjelloun, A. D. Sarma, C. Hayworth, S. U. Nabar, T. Sugihara, and J. Widom. Trio: A system for data, uncertainty, and lineage. In VLDB, pages 1151-1154. ACM, 2006.
3. R. Aharoni, E. Berger, A. Georgakopoulos, A. Perlstein, and P. Sprüssel. The max-flow min-cut theorem for countable networks. To appear in J. Combin. Theory (Series B).
4. D. Barbará, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Trans. Knowl. Data Eng., 4(5):487-502, 1992.
5. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718-741, 1984.
6. J. Boulos, N. N. Dalvi, B. Mandhani, S. Mathur, C. Ré, and D.Suciu. MYSTIQ: a system for finding more answers by using probabilities. In SIGMOD, pages 891-893. ACM, 2005.
7. M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci., 28(1):29-59, 1984. (Pubitemid 14569358)
8. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90. ACM, 1977.
9. S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic XML. In PODS, pages 109-118. ACM, 2008.
10. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, pages 864-875. Morgan Kaufmann, 2004.
11. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, pages 293-302. ACM, 2007.
12. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523-544, 2007.
13. X. Dong, A. Halevy, and C. Yu. Data integration with uncertainty. The VLDB Journal, 18(2):469-500, 2009.
14. X. L. Dong, A. Y. Halevy, and C. Yu. Data integration with uncertainty. In VLDB, pages 687-698. ACM, 2007.
15. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005. (Pubitemid 40612385)
16. R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: getting to the core. ACM Trans. Database Syst., 30(1):174-210, 2005.
17. R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst., 30(4):994-1055, 2005. (Pubitemid 43909010)
18. M. Fréchet. Sur les tableaux de corrélation dont les marges sont donnés. Annales de l'Université de Lyon, 4, 1951.
19. N. Fuhr and T. Rölleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst., 15(1):32-66, 1997. (Pubitemid 127685712)
20. G. Gottlob and A. Nash. Efficient core computation in data exchange. J. ACM, 55(2), 2008.
21. E. Grädel, Y. Gurevich, and C. Hirsch. The complexity of query reliability. In PODS, pages 227-234. ACM, 1998.
22. T. J. Green, G. Karvounarakis, Z. G. Ives, and V. Tannen. Update exchange with mappings and provenance. In VLDB, pages 675-686. ACM, 2007.
23. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In PODS, pages 31-40. ACM, 2007.
24. T. J. Green and V. Tannen. Models for incomplete and probabilistic information. IEEE Data Eng. Bull., 29(1):17-24, 2006.
25. P. Hall. On representatives of subsets. Journal of London Mathematical Society, 10:26-30, 1935.
26. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford lecture series in mathematics and its applications, 28. Oxford University Press, 2004.
27. T. Imielinski and W. L. Jr. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
28. M. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43:169-188, 1986.
29. R. M. Karp, M. Luby, and N. Madras. Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms, 10(3):429-448, 1989.
30. B. Kimelfeld, Y. Kosharovsky, and Y. Sagiv. Query efficiency in probabilistic XML models. In SIGMOD Conference, pages 701-714. ACM, 2008.
31. B. Kimelfeld and Y. Sagiv. Maximally joining probabilistic data. In PODS, pages 303-312. ACM, 2007.
32. K.-I. Ko. Some observations on the probabilistic algorithms and NP-hard problems. Inf. Process. Lett., 14(1):39-43, 1982.
33. C. Koch. Approximating predicates and expressive queries on probabilistic databases. In PODS, pages 99-108. ACM, 2008.
34. M. Luby and B. Velickovic. On deterministic approximation of DNF. Algorithmica, 16(4/5):415-433, 1996.
35. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
36. D. Morgenstern. Einfache beispiele zweidimensionaler verteilungen. Mitteilingsblatt f̈ur Mathematische Statistik, 8:234-235, 1956.
37. C. H. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci., 28(2):244-259, 1984.
38. C. Re, N. N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, pages 886-895. IEEE, 2007.
39. C. Re and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, volume 4797 of Lecture Notes in Computer Science, pages 186-200. Springer, 2007.
40. C. Re and D. Suciu. Materialized views in probabilistic databases for information exchange and query optimization. In VLDB, pages 51-62. ACM, 2007.
41. A. D. Sarma, L. Dong, and A. Halevy. Uncertainty in data integration. Managing and Mining Uncertain Data, 2009.
42. A. D. Sarma, X. Dong, and A. Y. Halevy. Bootstrapping pay-as-you-go data integration systems. In SIGMOD, pages 861-874. ACM, 2008.
43. A. D. Sarma, M. Theobald, and J. Widom. Exploiting lineage for confidence computation in uncertain and probabilistic databases. In ICDE, pages 1023-1032. IEEE, 2008.
44. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, pages 283-292. ACM, 2007.
45. M. Shaked and J. Shanthikumar. Stochastic Orders and Their Applications. Academic Press, San Diego, CA, 1994.
46. S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput., 21(2):316-328, 1992.
47. L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8:189-201, 1979.
48. S. Zachos. Probabilistic quantifiers and games. Journal of Computer and System Sciences, 36(3):433-451, 1988.
49. D. Zuckerman. On unapproximable versions of NP-complete problems. SIAM J. Comput., 25(6):1293-1304, 1996.