| 2007 | Decision trees for entity identification: approximation algorithms and hardness results. | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania |
| 2007 | Reasoning about XML update constraints. | Bogdan Cautis, Serge Abiteboul, Tova Milo |
| 2007 | The complexity of query containment in expressive fragments of XPath 2.0. | Balder ten Cate, Carsten Lutz |
| 2007 | A crash course on database queries. | Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren |
| 2007 | Privacy, accuracy, and consistency too: a holistic solution to contingency table release. | Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar |
| 2007 | Non-linear prefixes in query languages. | Antonio Badia, Stijn Vansummeren |
| 2007 | Marrying words and trees. | Rajeev Alur |
| 2006 | Finding global icebergs over distributed data sets. | Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun (Jim) Xu |
| 2006 | Efficiently ordering subgoals with access constraints. | Guizhen Yang, Michael Kifer, Vinay K. Chaudhri |
| 2006 | On the decidability and finite controllability of query processing in databases with incomplete information. | Riccardo Rosati |
| 2006 | Scalable computation of acyclic joins. | Anna Pagh, Rasmus Pagh |
| 2006 | Evolution of page popularity under random web graph models. | Rajeev Motwani, Ying Xu |
| 2006 | Privacy via pseudorandom sketches. | Nina Mishra, Mark Sandler |
| 2006 | On the efficiency of checking perfect privacy. | Ashwin Machanavajjhala, Johannes Gehrke |
| 2006 | Data exchange and incomplete information. | Leonid Libkin |
| 2006 | A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. | Lap-Kei Lee, H. F. Ting |
| 2006 | The complexity of data exchange. | Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan |
| 2006 | On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. | Solmaz Kolahi, Leonid Libkin |
| 2006 | Processing queries on tree-structured data efficiently. | Christoph Koch |
| 2006 | Finding and approximating top-k answers in keyword proximity search. | Benny Kimelfeld, Yehoshua Sagiv |
| 2006 | Efficient gossip-based aggregate computation. | Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi, Anand Srinivasan |
| 2006 | The containment problem for REAL conjunctive queries with inequalities. | T. S. Jayram, Phokion G. Kolaitis, Erik Vee |
| 2006 | From statistical knowledge bases to degrees of belief: an overview. | Joseph Y. Halpern |
| 2006 | Principles of dataspace systems. | Alon Y. Halevy, Michael J. Franklin, David Maier |
| 2006 | Structural characterizations of the semantics of XPath as navigation tool on a document. | Marc Gyssens, Jan Paredaens, Dirk Van Gucht, George H. L. Fletcher |