Size Bounds and Query Plans for Relational Joins. Atserias, A., Grohe, M., & Marx, D. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 739–748, 2008. Paper doi bibtex @inproceedings{DBLP:conf/focs/AtseriasGM08,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {739--748},
year = {2008},
crossref = {DBLP:conf/focs/2008},
url = {https://doi.org/10.1109/FOCS.2008.43},
doi = {10.1109/FOCS.2008.43},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/AtseriasGM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":{"_str":"527a09625e011a4c4b0005de"},"__v":8,"authorIDs":["545720022abc8e9f370000a8","oWamqdovFccHcFdCZ"],"author_short":["Atserias, A.","Grohe, M.","Marx, D."],"bibbaseid":"atserias-grohe-marx-sizeboundsandqueryplansforrelationaljoins-2008","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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","booktitle":"49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA","pages":"739–748","year":"2008","crossref":"DBLP:conf/focs/2008","url":"https://doi.org/10.1109/FOCS.2008.43","doi":"10.1109/FOCS.2008.43","timestamp":"Wed, 16 Oct 2019 14:14:54 +0200","biburl":"https://dblp.org/rec/conf/focs/AtseriasGM08.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/focs/AtseriasGM08,\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 booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n 2008, October 25-28, 2008, Philadelphia, PA, {USA}},\n pages = {739--748},\n year = {2008},\n crossref = {DBLP:conf/focs/2008},\n url = {https://doi.org/10.1109/FOCS.2008.43},\n doi = {10.1109/FOCS.2008.43},\n timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},\n biburl = {https://dblp.org/rec/conf/focs/AtseriasGM08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Atserias, A.","Grohe, M.","Marx, D."],"key":"DBLP:conf/focs/AtseriasGM08","id":"DBLP:conf/focs/AtseriasGM08","bibbaseid":"atserias-grohe-marx-sizeboundsandqueryplansforrelationaljoins-2008","role":"author","urls":{"Paper":"https://doi.org/10.1109/FOCS.2008.43"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","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":2008,"dataSources":["jS7oF7ycnJjCpQRs7"]}