| 2009 | A general datalog-based framework for tractable query answering over ontologies. Andrea Calì, Georg Gottlob, Thomas Lukasiewicz |
| 2009 | A web of concepts. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, S. Sathiya Keerthi, Srujana Merugu |
| 2009 | An efficient rigorous approach for identifying statistically significant frequent itemsets. Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2009 | Computing all skyline probabilities for uncertain data. Mikhail J. Atallah, Yinian Qi |
| 2009 | Consensus answers for queries over probabilistic databases. Jian Li, Amol Deshpande |
| 2009 | Distributed XML design. Serge Abiteboul, Georg Gottlob, Marco Manna |
| 2009 | Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. Ke Yi |
| 2009 | Equivalence of SQL queries in presence of embedded dependencies. Rada Chirkova, Michael R. Genesereth |
| 2009 | Equivalence of nested queries with mixed semantics. David DeHaan |
| 2009 | Exceeding expectations and clustering uncertain data. Sudipto Guha, Kamesh Munagala |
| 2009 | Generalized schema-mappings: from termination to tractability. Bruno Marnette |
| 2009 | Indexing uncertain data. Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi |
| 2009 | Optimal sampling from sliding windows. Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo |
| 2009 | Optimal tracking of distributed heavy hitters and quantiles. Ke Yi, Qin Zhang |
| 2009 | Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA Jan Paredaens, Jianwen Su |
| 2009 | Relationship privacy: output perturbation for queries with joins. Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Suciu |
| 2009 | Relative information completeness. Wenfei Fan, Floris Geerts |
| 2009 | Reverse data exchange: coping with nulls. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan |
| 2009 | Running tree automata on probabilistic XML. Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv |
| 2009 | Satisfiability and relevance for queries over active documents. Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu |
| 2009 | Satisfiability of downward XPath with data equality tests. Diego Figueira |
| 2009 | Secondary indexing in one dimension: beyond b-trees and bitmap indexes. Rasmus Pagh, Srinivasa Rao Satti |
| 2009 | Similarity caching. Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii |
| 2009 | Size and treewidth bounds for conjunctive queries. Georg Gottlob, Stephanie Tien Lee, Gregory Valiant |
| 2009 | Space-optimal heavy hitters with strong error bounds. Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss |
| 2009 | The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou |
| 2009 | The finite model theory toolbox of a database theoretician. Leonid Libkin |
| 2009 | Worst-case efficient range search indexing: invited tutorial. Lars Arge |
| 2009 | XML schema mappings. Shun'ichi Amano, Leonid Libkin, Filip Murlak |
| 2009 | XML with incomplete information: models, properties, and query answering. Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo |
| 2009 | XPath evaluation in linear time with polynomial combined complexity. Pawel Parys |