On Factorisation of Provenance Polynomials

3rd Workshop on the Theory and Practice of Provenance, TaPP 2011

Volumn , Issue , 2011, Pages

  Olteanu, Dan ^a   Závodný, Jakub ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85094668813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. ATSERIAS, A., GROHE, M., AND MARX, D. Size bounds and query plans for relational joins. In FOCS (2008), pp. 739–748.
2. CHENEY, J., CHITICARIU, L., AND TAN, W. C. Provenance in databases: Why, how, and where. Foundations and Trends in Databases 1, 4 (2009).
3. ELBASSIONI, K. M., MAKINO, K., AND RAUF, I. On the readability of monotone boolean formulae. In COCOON (2009).
4. FINK, R., AND OLTEANU, D. On the Optimal Approximation of Queries Using Tractable Propositional Languages. In ICDT (2011).
5. GOLUMBIC, M. C., PELED, U. N., AND ROTICS, U. Chain graphs have unbounded readability. Tech. rep., University of Haifa, 2006.
6. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. The complexity of acyclic conjunctive queries. J. ACM 48 (May 2001), 431–498.
7. GREEN, T. J., KARVOUNARAKIS, G., AND TANNEN, V. Provenance semirings. In PODS (2007).
8. GROHE, M., GUREVICH, Y., LEINDERS, D., SCHWEIKARDT, N., TYSZKIEWICZ, J., AND DEN BUSSCHE, J. V. Database query processing using finite cursor machines. TCS 44, 4 (2009).
9. KOUTRIS, P., AND SUCIU, D. Parallel evaluation of conjunctive queries. In PODS (2011). to appear.
10. OLTEANU, D., AND HUANG, J. “Using OBDDs for Efficient Query Evaluation on Probabilistic Databases”. In SUM (2008).
11. OLTEANU, D., AND ZÁVODNÝ, J. Factorised representations of query results. Tech. rep., Oxford, April 2011. Also arXiv report 1104.0867, available at http://arxiv.org/abs/1104.0867.
12. RÉ, C., AND SUCIU, D. Approximate lineage for probabilistic databases. PVLDB 1, 1 (2008).
13. SUCIU, D., OLTEANU, D., RÉ, C., AND KOCH, C. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.
14. VADHAN, S. The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. Comput. 32, 2 (2001).