| 2013 | Flag & check: data access with monadically defined queries. | Sebastian Rudolph, Markus Krtzsch |
| 2013 | Trial for RDF: adapting graph query languages for RDF data. | Leonid Libkin, Juan L. Reutter, Domagoj Vrgoc |
| 2013 | The complexity of mining maximal frequent subgraphs. | Benny Kimelfeld, Phokion G. Kolaitis |
| 2013 | I/O-efficient planar range skyline and attrition priority queues. | Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon |
| 2013 | Enumeration of first-order queries on classes of structures with bounded expansion. | Wojciech Kazana, Luc Segoufin |
| 2013 | Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. | Piotr Indyk |
| 2013 | Well-founded semantics for extended datalog and ontological reasoning. | Andr Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob |
| 2013 | Verification of relational data-centric dynamic systems with external services. | Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, Marco Montali |
| 2013 | Deciding monotone duality and identifying frequent itemsets in quadratic logspace. | Georg Gottlob |
| 2013 | On the BDD/FC conjecture. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2013 | When is naive evaluation possible? | Amlie Gheerbrant, Leonid Libkin, Cristina Sirangelo |
| 2013 | On XPath with transitive axes and data tests. | Diego Figueira |
| 2013 | Spanners: a formal framework for information extraction. | Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren |
| 2013 | The fine classification of conjunctive queries and parameterized logarithmic space complexity. | Hubie Chen, Moritz Mller |
| 2013 | Foundations of data-aware process analysis: a database theory perspective. | Diego Calvanese, Giuseppe De Giacomo, Marco Montali |
| 2013 | Verification of database-driven systems via amalgamation. | Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk |
| 2013 | Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. | Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter |
| 2013 | The ACM PODS Alberto O. Mendelzon test-of-time award 2013. | Michael Benedikt, Tova Milo, Dirk Van Gucht |
| 2013 | Communication steps for parallel query processing. | Paul Beame, Paraschos Koutris, Dan Suciu |
| 2013 | A trichotomy for regular simple path queries on graphs. | Guillaume Bagan, Angela Bonifati, Benot Groz |
| 2013 | Semantic acyclicity on graph databases. | Pablo Barcel Baeza, Miguel Romero, Moshe Y. Vardi |
| 2013 | Querying graph databases. | Pablo Barcel Baeza |
| 2013 | On the expressive power of update primitives. | Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller |
| 2013 | Nearest neighbor searching under uncertainty II. | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang |
| 2013 | Learning and verifying quantified boolean queries by example. | Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz |