A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries

Bas Ketsman, Dan Suciu. A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries. In Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, editors, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017. pages 417-428, ACM, 2017. [doi]

@inproceedings{KetsmanS17,
  title = {A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries},
  author = {Bas Ketsman and Dan Suciu},
  year = {2017},
  doi = {10.1145/3034786.3034788},
  url = {http://doi.acm.org/10.1145/3034786.3034788},
  researchr = {https://researchr.org/publication/KetsmanS17},
  cites = {0},
  citedby = {0},
  pages = {417-428},
  booktitle = {Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017},
  editor = {Emanuel Sallinger and Jan Van den Bussche and Floris Geerts},
  publisher = {ACM},
  isbn = {978-1-4503-4198-1},
}