Since 1997, two awards are given annually 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 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.
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.
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:
Recipients of the Best Student Paper Award:
- Sepehr Assadi:
- Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
- Adam Sealfon:
- Shortest Paths and Distances with Differential Privacy
- Pawel Parys:
- XPath Evaluation in Linear Time with Polynomial Combined Complexity
Recipients of the Best Newcomer Award:
- Karl Schnaitter, Neoklis Polyzotis:
- Evaluating Rank Joins with Optimal Cost
- Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
- XML Transformation by Tree-Walking Transducers with Invisible Pebbles
- Michael Bender, Haodong Hu:
- An Adaptive Packed-Memory Array
- Martin Abadi, Bogdan Warinschi:
- Security Analysis of Cryptographically Controlled Access to XML Documents
- Maarten Marx:
- XCPath, the first order complete XPath dialect
- Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan:
- Algorithms for Data Migration with Cloning
- Chung-Min Chen, Christine T. Cheng:
- From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries
- Kim S. Larsen:
- Relaxed Multi-Way Trees with Group Updates
- Marc Spielmann:
- Verification of Relational Transducers for Electronic Commerce
- Steven Dawson, Sabrina De Capitani di Vimercati, Patrick Lincoln, Pierangela Samarati:
- Minimal Data Upgrading to Prevent Inference and Association
- Vasilis Samoladas, Daniel P. Miranker:
- A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries
- Oliver M. Duschka, Michael R. Genesereth:
- Answering Recursive Queries Using Views