Bounds and Algorithms for joins via fractional edge covers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8000, Issue , 2013, Pages 321-338

  Grohe, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; QUERY PROCESSING;

EDGE COVER; JOIN OPERATION; JOIN PROCESSING; RELATIONAL ALGEBRA;

COMPUTATION THEORY;

EID: 84892685436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-41660-6_17     Document Type: Article

References (11)

1. Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 739-748 (2008)
2. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing 14, 210-223 (1985)
3. Chung, F., Frank, P., Graham, R., Shearer, J.: Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory, Series A 43, 23-37 (1986)
4. Gottlob, G., Lee, S.T., Valiant, G., Valiant, P.: Size and treewidth bounds for conjunctive queries. Journal of the ACM 59(3) (2012)
5. Gottlob, G., Lee, S.T., Valiant, G.J.: Size and treewidth bounds for conjunctive queries. In: Proceedings of the 28th ACM Symposium on Principles of Database Systems, pp. 45-54 (2009)
6. Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 289-298 (2006)
7. Ngo, H.Q., Porat, E., Ré, C., Rudra, A.: Worst-case optimal join algorithms. In: Proceedings of the 31st ACM Symposium on Principles of Database Systems (2012)
8. Radhakrishnan, J.: Entropy and counting. In: Misra, J.C. (ed.) Computational Mathematics, Modelling and Algorithms. Narosa Pub. House (2003)
9. Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379-423, 623-656 (1948)
10. Valiant, G., Valiant, P.: Size bounds for conjunctive queries with general functional dependencies. Arxiv preprint arXiv:0909.2030 (2009)
11. Veldhuizen, T.L.: Leapfrog triejoin: A worst-case optimal join algorithm. arXiv e-print archive arXiv:1210.0481 (2012), http://arxiv.org/abs/1210.0481