Size Bounds and Query Plans for Relational Joins. Atserias, A., Grohe, M., & Marx, D. SIAM J. Comput., 42(4):1737–1767, 2013. Paper doi bibtex @article{DBLP:journals/siamcomp/AtseriasGM13,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1737--1767},
year = {2013},
url = {https://doi.org/10.1137/110859440},
doi = {10.1137/110859440},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":{"_str":"527a09625e011a4c4b00059a"},"__v":8,"authorIDs":["545720022abc8e9f370000a8","oWamqdovFccHcFdCZ"],"author_short":["Atserias, A.","Grohe, M.","Marx, D."],"bibbaseid":"atserias-grohe-marx-sizeboundsandqueryplansforrelationaljoins-2013","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Albert"],"propositions":[],"lastnames":["Atserias"],"suffixes":[]},{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]},{"firstnames":["Dániel"],"propositions":[],"lastnames":["Marx"],"suffixes":[]}],"title":"Size Bounds and Query Plans for Relational Joins","journal":"SIAM J. Comput.","volume":"42","number":"4","pages":"1737–1767","year":"2013","url":"https://doi.org/10.1137/110859440","doi":"10.1137/110859440","timestamp":"Thu, 08 Jun 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/siamcomp/AtseriasGM13,\n author = {Albert Atserias and\n Martin Grohe and\n D{\\'{a}}niel Marx},\n title = {Size Bounds and Query Plans for Relational Joins},\n journal = {{SIAM} J. Comput.},\n volume = {42},\n number = {4},\n pages = {1737--1767},\n year = {2013},\n url = {https://doi.org/10.1137/110859440},\n doi = {10.1137/110859440},\n timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Atserias, A.","Grohe, M.","Marx, D."],"key":"DBLP:journals/siamcomp/AtseriasGM13","id":"DBLP:journals/siamcomp/AtseriasGM13","bibbaseid":"atserias-grohe-marx-sizeboundsandqueryplansforrelationaljoins-2013","role":"author","urls":{"Paper":"https://doi.org/10.1137/110859440"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","downloads":0,"keywords":[],"search_terms":["size","bounds","query","plans","relational","joins","atserias","grohe","marx"],"title":"Size Bounds and Query Plans for Relational Joins","year":2013,"dataSources":["jS7oF7ycnJjCpQRs7"]}