特邀文章前言

Journal of the ACM (JACM) Pub Date : 2018-03-15 DOI:10.1145/3186892

É. Tardos

{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3186892","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue consists of the article “Worst-Case Optimal Join Algorithms” by Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, which won the best paper award at the 35th Annual ACM SIGMOD/PODS International Conference on Management of Data (PODS’12). We would like to thank the PODS’12 Program Committee for their help in selecting this invited work, and we also thank editor Phokion Kolaitis for handling the paper.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Article Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3186892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Article section of this issue consists of the article “Worst-Case Optimal Join Algorithms” by Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, which won the best paper award at the 35th Annual ACM SIGMOD/PODS International Conference on Management of Data (PODS’12). We would like to thank the PODS’12 Program Committee for their help in selecting this invited work, and we also thank editor Phokion Kolaitis for handling the paper.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the ACM (JACM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3186892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3186892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本期特邀文章部分由Hung Q. Ngo, Ely Porat, Christopher r和Atri Rudra的文章“最坏情况下最优连接算法”组成，该文章在第35届ACM SIGMOD/PODS国际数据管理会议(PODS ' 12)上获得最佳论文奖。我们要感谢PODS ' 12 Program Committee在选择这篇受邀作品时的帮助，我们也要感谢编辑Phokion Kolaitis对论文的处理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Invited Article Foreword

The Invited Article section of this issue consists of the article “Worst-Case Optimal Join Algorithms” by Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, which won the best paper award at the 35th Annual ACM SIGMOD/PODS International Conference on Management of Data (PODS’12). We would like to thank the PODS’12 Program Committee for their help in selecting this invited work, and we also thank editor Phokion Kolaitis for handling the paper.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of the ACM (JACM)

自引率

0.00%

发文量