Abstract is missing.
- Foundations of data-aware process analysis: a database theory perspectiveDiego Calvanese, Giuseppe De Giacomo, Marco Montali. 1-12 [doi]
- The complexity of mining maximal frequent subgraphsBenny Kimelfeld, Phokion G. Kolaitis. 13-24 [doi]
- Deciding monotone duality and identifying frequent itemsets in quadratic logspaceGeorg Gottlob. 25-36 [doi]
- Spanners: a formal framework for information extractionRonald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren. 37-48 [doi]
- Learning and verifying quantified boolean queries by exampleAzza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz. 49-60 [doi]
- The ACM PODS Alberto O. Mendelzon test-of-time award 2013Michael Benedikt, Tova Milo, Dirk Van Gucht. 61-62 [doi]
- Verification of database-driven systems via amalgamationMikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk. 63-74 [doi]
- When is naive evaluation possible?Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo. 75-86 [doi]
- Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transformPiotr Indyk. 87-90 [doi]
- Collaborative data-driven workflows: think global, act localSerge Abiteboul, Victor Vianu. 91-102 [doi]
- I/O-efficient planar range skyline and attrition priority queuesCasper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon. 103-114 [doi]
- Nearest neighbor searching under uncertainty IIPankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang. 115-126 [doi]
- On the BDD/FC conjectureTomasz Gogacz, Jerzy Marcinkowski. 127-138 [doi]
- On the expressive power of update primitivesTom J. Ameloot, Jan Van den Bussche, Emmanuel Waller. 139-150 [doi]
- Flag & check: data access with monadically defined queriesSebastian Rudolph, Markus Krötzsch. 151-162 [doi]
- Verification of relational data-centric dynamic systems with external servicesBabak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, Marco Montali. 163-174 [doi]
- Querying graph databasesPablo Barceló Baeza. 175-188 [doi]
- Charting the tractability frontier of certain conjunctive query answeringJef Wijsen. 189-200 [doi]
- Trial for RDF: adapting graph query languages for RDF dataLeonid Libkin, Juan L. Reutter, Domagoj Vrgoc. 201-212 [doi]
- Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNPMeghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter. 213-224 [doi]
- Well-founded semantics for extended datalog and ontological reasoningAndré Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob. 225-236 [doi]
- Semantic acyclicity on graph databasesPablo Barceló Baeza, Miguel Romero 0001, Moshe Y. Vardi. 237-248 [doi]
- On XPath with transitive axes and data testsDiego Figueira. 249-260 [doi]
- A trichotomy for regular simple path queries on graphsGuillaume Bagan, Angela Bonifati, Benoît Groz. 261-272 [doi]
- Communication steps for parallel query processingPaul Beame, Paraschos Koutris, Dan Suciu. 273-284 [doi]
- A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operatorLimsoon Wong. 285-296 [doi]
- Enumeration of first-order queries on classes of structures with bounded expansionWojciech Kazana, Luc Segoufin. 297-308 [doi]
- The fine classification of conjunctive queries and parameterized logarithmic space complexityHubie Chen, Moritz Müller. 309-320 [doi]