default search action
32nd PODS 2013: New York, NY, USA
- Richard Hull, Wenfei Fan:
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013. ACM 2013, ISBN 978-1-4503-2066-5
Welcome and keynote address
- Diego Calvanese, Giuseppe De Giacomo, Marco Montali:
Foundations of data-aware process analysis: a database theory perspective. 1-12
Data mining/information retrieval
- Benny Kimelfeld, Phokion G. Kolaitis:
The complexity of mining maximal frequent subgraphs. 13-24 - Georg Gottlob:
Deciding monotone duality and identifying frequent itemsets in quadratic logspace. 25-36 - Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Spanners: a formal framework for information extraction. 37-48 - Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz:
Learning and verifying quantified boolean queries by example. 49-60
Awards session
- Michael Benedikt, Tova Milo, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2013. 61-62 - Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. 63-74 - Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo:
When is naive evaluation possible? 75-86
Tutorial 1
- Piotr Indyk:
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. 87-90 - Serge Abiteboul, Victor Vianu:
Collaborative data-driven workflows: think global, act local. 91-102
Indexing/query answering
- Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon:
I/O-efficient planar range skyline and attrition priority queues. 103-114 - Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest neighbor searching under uncertainty II. 115-126 - Tomasz Gogacz, Jerzy Marcinkowski:
On the BDD/FC conjecture. 127-138
Query processing/verification
- Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller:
On the expressive power of update primitives. 139-150 - Sebastian Rudolph, Markus Krötzsch:
Flag & check: data access with monadically defined queries. 151-162 - Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, Marco Montali:
Verification of relational data-centric dynamic systems with external services. 163-174
Tutorial 2
- Pablo Barceló Baeza:
Querying graph databases. 175-188 - Jef Wijsen:
Charting the tractability frontier of certain conjunctive query answering. 189-200
RDF and ontologies
- Leonid Libkin, Juan L. Reutter, Domagoj Vrgoc:
Trial for RDF: adapting graph query languages for RDF data. 201-212 - Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. 213-224 - André Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob:
Well-founded semantics for extended datalog and ontological reasoning. 225-236
Graph and XML querying
- Pablo Barceló Baeza, Miguel Romero, Moshe Y. Vardi:
Semantic acyclicity on graph databases. 237-248 - Diego Figueira:
On XPath with transitive axes and data tests. 249-260 - Guillaume Bagan, Angela Bonifati, Benoît Groz:
A trichotomy for regular simple path queries on graphs. 261-272
Query languages
- Paul Beame, Paraschos Koutris, Dan Suciu:
Communication steps for parallel query processing. 273-284 - Limsoon Wong:
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator. 285-296 - Wojciech Kazana, Luc Segoufin:
Enumeration of first-order queries on classes of structures with bounded expansion. 297-308 - Hubie Chen, Moritz Müller:
The fine classification of conjunctive queries and parameterized logarithmic space complexity. 309-320
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.