Factorised representations of query results: Size bounds and readability

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 285-298

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Conjunctive queries; Data factorisation; Hierarchical queries; Provenance; Query evaluation; Readability; Size bounds

Indexed keywords

CONJUNCTIVE QUERIES; HIERARCHICAL QUERIES; PROVENANCE; QUERY EVALUATION; READABILITY; SIZE BOUNDS;

DATABASE SYSTEMS;

FACTORIZATION;

EID: 84863944241     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2274576.2274607     Document Type: Conference Paper

References (21)

1. A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. In Foundations of Computer Science (FOGS), 2008.
2. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB Journal, 16(4), 2007.
3. K. M. Elbassioni, K. Makino, and I. Rauf. On the readability of monotone boolean formulae. In International Computing and Combinatorics Conference (COCOON), 2009.
4. M. C. Golumbic, A. Mintz, and U. Rotics. An improvement on the complexity of factoring read-once boolean functions. Discrete Applied Mathematics, 156(10), 2008.
5. M. C. Golumbic, U. N. Peled, and U. Rotics. Chain graphs have unbounded readability. Technical report, University of Haifa, 2006.
6. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Principles of Database Systems (PODS), 1999.
7. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of ACM, 48, 2001.
8. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In Principles of Database Systems (PODS), 2007.
9. M. Grohe, Y. Gurevich, D. Leinders, N. Schweikardt, J. Tyszkiewicz, and J. V. den Bussche. Database query processing using finite cursor machines. Theory of Computing Systems, 44(4), 2009.
10. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In Symposium on Discrete Algorithms (SODA), 2006.
11. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Symposium on Theory of Computing (STOC), 2001.
12. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of ACM, 31(4), 1984.
13. P. Koutris and D. Suciu. Parallel evaluation of conjunctive queries. In Principles of Database Systems (PODS), 2011.
14. D. Marx. Approximating fractional hypertree width. In Symposium on Discrete Algorithms (SODA), 2009.
15. D. Olteanu and J. Huang. Using obdds for efficient query evaluation on probabilistic databases. In Scalable Uncertainty Management (SUM), 2008.
16. D. Olteanu, C. Koch, and L. Antova. World-set decompositions: Expressiveness and efficient algorithms. Theoretical Computer Science, 403(2-3), 2008.
17. D. Olteanu and J. Zavodny. Factorised representations of query results. Technical report, Oxford, April 2011. http://arxiv.org/abs/1104.0867.
18. D. Olteanu and J. Zavodny. On factorisation of provenance polynomials. In Theory and Practice of Provenance (TaPP), 2011.
19. N. Robertson and P. Seymour. Graph minors, i. excluding a forest. Journal of Combinatorial Theory, Series B, 35(1), 1983.
20. D. Suciu, D. Olteanu, C. Ré, and C. Koch. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.
21. S. Vadhan. The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing, 32(2), 2001.