Best Paper Awards (PODS)

1997-2018

Posted by pxzhang on January 8, 2019
Year Title Authors
2018 Entity Matching with Active Monotone Classification Yufei Tao, Chinese University of Hong Kong
2017 Dichotomies in Ontology-Mediated Querying with the Guarded Fragment André Hernich, University of Liverpool
Carsten Lutz, University of Bremen
Fabio Papacchini, University of Liverpool
Frank Wolter, University of Liverpool
2016 FAQ: Questions Asked Frequently Mahmoud Abo Khamis, University at Buffalo
Hung Q. Ngo, University at Buffalo
Atri Rudra, University at Buffalo
2015 Parallel-Correctness and Transferability for Conjunctive Queries Tom J. Ameloot, Hasselt University
Gaetano Geck, Universität Dortmund
Bas Ketsman, Hasselt University
Frank Neven, Hasselt University
Thomas Schwentick, Universität Dortmund
2014 Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture Tom J. Ameloot, Hasselt University
Bas Ketsman, Hasselt University
Frank Neven, Hasselt University
Daniel Zinn, LogicBlox
2013 Verification of database-driven systems via amalgamation Mikołaj Bojańczyk, University of Warsaw
Luc Segoufin, INRIA
Szymon Toruńczyk, University of Warsaw
2012 Worst-case Optimal Join Algorithms Hung Q. Ngo, University at Buffalo
Ely Porat, Bar-Ilan University
Christopher Ré, University of Wisconsin
Atri Rudra, University at Buffalo
2011 Data Exchange Beyond Complete Data Marcelo Arenas, Pontificia Universidad Católica de Chile
Jorge Pérez, Universidad de Chile
Juan Reutter, University of Edinburgh
2010 An Optimal Algorithm for the Distinct Elements Problem Daniel M. Kane, Harvard University
Jelani Nelson, Massachusetts Institute of Technology
David P. Woodruff, IBM Research
2009 Size and Treewidth Bounds for Conjunctive Queries Georg Gottlob, University of Oxford
Stephanie Lee, University of Oxford
Gregory Valient, University of California Berkeley
2008 Estimating PageRank on Graph Streams Atish Das Sarma, Georgia Institute of Technology
Sreenivas Gollapudi, Microsoft Research
Rina Panigrahy, Microsoft Research
2007 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants Georg Gottlob, University of Oxford
Zoltan Miklos, University of Oxford
Thomas Schwentick, Universität Dortmund
2006 Two-variable logic on data trees and XML reasoning Mikolaj Bojanczyk, Warsaw University
Claire David, Université Paris
Anca Muscholl, Université Paris
Thomas Schwentick, Universität Dortmund
Luc Segoufin, Université Paris
2005 On the complexity of division and set joins in the relational algebra Dirk Leinders & Jan Van den Bussche, Limburgs Universitair Centrum
2005 XML data exchange: consistency and query answering Marcelo Arenas & Leonid Libkin, University of Toronto
2004 Conditional XPath, the first order complete XPath dialect Maarten Marx, University of Amsterdam
2003 An Information-Theoretic Approach to Normal Forms for Relational and XML Data Marcelo Arenas & Leonid Libkin, University of Toronto
2002 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction Georg Gottlob & Christoph Koch, Technische Universität Wien
2001 Optimal aggregation algorithms for middleware Ronald Fagin, IBM Research
Amnon Lotem, University of Maryland
Moni Naor, Weizmann Institute of Science
2000 Auditing Boolean attributes Jon Kleinberg, Cornell University
Christos Papadimitriou, University of California Berkeley
Prabhakar Raghavan, IBM Research
1999 Exact and approximate aggregation in constraint query languages Michael Benefikt & Leonid Libkin, Bell Labs
1998 A lower bound theorem for indexing schemes and its application to multidimensional range queries Vasilis Samoladas & Daniel P. Miranker, University of Texas at Austin
1998 Expressiveness of structured document query languages based on attribute grammars Frank Neven & Jan Van den Bussche, Limburgs Universitair Centrum
1997 On the Complexity of Database Queries Christos H. Papadimitriou, University of California Berkeley
Mihalis Yannakakis, Bell Labs