Abstract
Among the operations of relational algebra, the join operation tends to be the most costly. There is a wealth of research in the database literature devoted to efficient join processing. Short of fully computing the result of a join or a sequence of joins (we use the term join query in the following), in many applications it is also important to get good bounds on the size of the result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing 14, 210–223 (1985)
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)
Gottlob, G., Lee, S.T., Valiant, G., Valiant, P.: Size and treewidth bounds for conjunctive queries. Journal of the ACMÂ 59(3) (2012)
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)
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)
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)
Radhakrishnan, J.: Entropy and counting. In: Misra, J.C. (ed.) Computational Mathematics, Modelling and Algorithms. Narosa Pub. House (2003)
Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379–423, 623–656 (1948)
Valiant, G., Valiant, P.: Size bounds for conjunctive queries with general functional dependencies. Arxiv preprint arXiv:0909.2030 (2009)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grohe, M. (2013). Bounds and Algorithms for Joins via Fractional Edge Covers. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-41660-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41659-0
Online ISBN: 978-3-642-41660-6
eBook Packages: Computer ScienceComputer Science (R0)