Maximally joining probabilistic data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 303-312

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Maximal answers; Natural join; Probabilistic databases; Query and data complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUERY PROCESSING;

MAXIMAL ANSWERS; NATURAL JOIN; PROBABILISTIC DATABASES; QUERY-AND-DATA COMPLEXITY;

DATA REDUCTION;

EID: 35448980379     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265572     Document Type: Conference Paper

References (25)

1. D. Barbará, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Trans. Knowl. Data Eng., 4(5), 1992.
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3), 1983.
3. P. A. Bernstein and N. Goodman. Power of natural semijoins. SIAM J. Comput., 10(4), 1981.
4. R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In P. M. Stocker, W. Kent, and P. Hammersley, editors, VLDB, 1987.
5. S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, and Y. Sagiv. Full disjunctions: Polynomial-delay iterators in action. In VLDB, 2006.
6. S. Cohen and Y. Sagiv. An abstract framework for generating maximal answers to queries. In ICDT, 2005.
7. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. In PODS, 2005.
8. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. To appear in J. Comput. Syst. Sci. (an extended version of [7]), 2006.
9. N. N. Dalvi, G. Miklau, and D. Suciu. Asymptotic conditional probabilities for conjunctive queries. In ICDT, 2005.
10. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
11. D. Dey and S. Sarkar. A probabilistic relational model and algebra. ACM Trans. Database Syst., 21(3), 1996.
12. R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM, 30(3), 1983.
13. 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), 1997.
14. C. A. Galindo-Legaria. Outerjoins as disjunctions. In SIGMOD, 1994.
15. D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27, 1988.
16. Y. Kanza, W. Nutt, and Y. Sagiv. Querying incomplete information in semistructured data. J. Comput. Syst. Sci., 64(3), 2002.
17. Y. Kanza and Y. Sagiv. Computing full disjunctions. In PODS, 2003.
18. L. V. S. Lakshmanan, N. Leone, R. Ross, and V. S. Subrahmanian. ProbView: A flexible probabilistic database system. ACM Trans. Database Syst., 22(3), 1997.
19. Y. E. Lien. On the equivalence of database models. J. ACM, 29(2), 1982.
20. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In VLDB, 2002.
21. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4), 1983.
22. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions. In PODS, 1996.
23. S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput., 21(2), 1992.
24. L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8, 1979.
25. M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, 1981.