Personal tools
You are here: Home About PODS PODS Best Paper Awards

PODS Best Paper Awards

Since 1997, two awards are given anually to the best papers published in PODS.

Best Paper Award:
This is an award for the best of all papers submitted, as judged by the program committee.

Best Newcomer Award (1997 - 2008):
This is an award to the best submission, as judged by the program committee, written solely by authors who have never published in earlier PODS proceedings.

Best Student Award (2009 - ):
From PODS 2009 on the Best Newcomer Award is replaced by the Best Student Award. This is an award for the best submission, as judged by the program committee, written exclusively by a student or students. An author is considered as a student if at the time of submission, the author is enrolled in a program at a university or institution leading to a doctoral/master's/bachelor's degree.

The program committee reserves the right to give both awards to the same paper, not to give an award, or to split an award among several papers. Papers authored or  co-authored by program committee members are not eligible for an award.


Recipients of the Best Paper Award:

1997 Christos H. Papadimitriou, Mihalis Yannakakis: On the Complexity of Database Queries
1998 Frank Neven, Jan Van den Bussche: Expressiveness of Structured Document Query Languages Based on Attribute Grammar - and - Vasilis Samoladas, Daniel P. Miranker: A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries

1999

Michael Benedikt, Leonid Libkin:  Exact and Approximate Aggregation in Constraint Query Languages

2000

Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:  Auditing Boolean Attributes

2001

Ronald Fagin, Amnon Lotem, Moni Naor:  Optimal Aggregation Algorithms for Middleware

2002

Georg Gottlob, Christoph Koch:  Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

2003

Marcelo Arenas, Leonid Libkin:  An Information-Theoretic Approach to Normal Forms for Relational and XML Data
2004 Maarten Marx:  XCPath, the first order complete XPath dialect

2005

Dirk Leinders, Jan Van den Bussche: On the complexity of division and set joins in the relational algebra - and - Marcelo Arenas, Leonid Libkin: XML Data Exchange: Consistency and Query Answering

2006

Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-Variable Logic on Data Trees and XML Reasoning

2007

Georg Gottlob, Zoltan Miklos, Thomas Schwentick: Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants

2008

Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy: Estimating PageRank on Graph Streams

2009

Georg Gottlob, Stephanie Lee, Gregory Valiant: Size and Treewidth Bounds for Conjunctive Queries


Recipients of the Best Newcomer Award:

1997 Oliver M. Duschka, Michael R. Genesereth: Answering Recursive Queries Using Views

1998

Vasilis Samoladas, Daniel P. Miranker: A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries

1999

Steven Dawson, Sabrina De Capitani di Vimercati, Patrick Lincoln, Pierangela Samarati: Minimal Data Upgrading to Prevent Inference and Association
2000 Marc Spielmann: Verification of Relational Transducers for Electronic Commerce
2001 Kim S. Larsen: Relaxed Multi-Way Trees with Group Updates

2002

Chung-Min Chen, Christine T. Cheng: From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries

2003

Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan: Algorithms for Data Migration with Cloning
2004 Maarten Marx:  XCPath, the first order complete XPath dialect

2005

Martin Abadi, Bogdan Warinschi: Security Analysis of Cryptographically Controlled Access to XML Documents
2006 Michael Bender, Haodong Hu: An Adaptive Packed-Memory Array

2007

Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel: XML Transformation by Tree-Walking Transducers with Invisible Pebbles
2008 Karl Schnaitter, Neoklis Polyzotis: Evaluating Rank Joins with Optimal Cost

Recipients of the Best Student Paper Award:

2009 Pawel Parys: XPath Evaluation in Linear Time with Polynomial Combined Complexity
Document Actions