ACM SIGMOD City, Country, Year
sigmod pods logo

PODS 2013: Accepted Research Papers

  • The Complexity of Mining Maximal Frequent Subgraphs
    Benny Kimelfeld, IBM Almaden Research Center; Phokion Kolaitis, University of California Santa Cruz and IBM Almaden Research Center
  • Deciding Monotone Duality and Identifying Frequent Item Sets in Quadratic Logspace 
    Georg Gottlob, University of Oxford
  • Spanners: A Formal Framework for Information Extraction
    Ronald Fagin, IBM Almaden Research Center; Benny Kimelfeld, IBM Almaden Research Center; Frederick Reiss, IBM Almaden Research Center; Stijn Vansummeren, Université libre de Bruxelles
  • Learning and Verifying Quantified Boolean Queries by Example
    Azza Abouzied, Yale University; Dana Angluin, Yale University;  Christos Papadimitriou, University of California, Berkeley; Joseph Hellerstein, University of California, Berkeley; Avi Silberschatz, Yale University
  • The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2013: Revealing Information while Preserving Privacy
    Irit Dinur, Weizmann Institute of Science; Kobbi Nissim, Ben-Gurion University
  • Verification of Database-driven Systems via Amalgamation
    Mikołaj Bojańczyk, Warsaw University; Luc Segoufin, INRIA, LSV, ENS-Cachan; Szymon Toruńczyk, Warsaw University
  • When is Naïve Evaluation Possible?
    Amélie Gheerbrant, University of Edinburgh; Leonid Libkin, University of Edinburgh; Cristina Sirangelo, INRIA & CNRS, LSV, ENS-Cachan
  • Collaborative Data-Driven Workflows: Think Global, Act Local
    Serge Abiteboul, INRIA-Saclay; Victor Vianu, University of California, San Diego
  • I/O-Efficient Planar Range Skyline and Attrition Priority Queues
    Casper Kejlberg-Rasmussen, Aarhus University; Yufei Tao, Chinese University of Hong Kong; Konstantinos Tsakalidis, Hong Kong University of Science and Technology; Kostas Tsichlas, Aristotle University of Thessaloniki; Jeonghun Yoon, Korea Advanced Institute of Science and Technology
  • Nearest Neighbor Searching Under Uncertainty II
    Pankaj K. Agarwal, Duke University; Boris Aronov, Polytechnic Institute of NYU; Sariel Har-Peled, University of Illinois; Jeff M. Phillips, University of Utah; Ke Yi, Hong Kong University of Science and Technology; Wuzhou Zhang, Duke University
  • On the BDD/FC Conjecture
    Jerzy Marcinkowski, Wrocław University; Tomasz Gogacz, Wrocław University
  • On the Expressive Power of Update Primitives
    Tom Ameloot, Hasselt University & transnational University of Limburg; Jan Van den Bussche, Hasselt University & transnational University of Limburg; Emmanuel Waller, University of Paris-Sud
  • Flag & Check: Data Access with Monadically Defined Queries
    Sebastian Rudolph, Karlsruhe Institute of Technology; Markus Krötzsch, University of Oxford
  • Verification of Relational Data-Centric Dynamic Systems with External Services
    Babak Bagheri Hariri, Free University of Bozen-Bolzano; Diego Calvanese, Free University of Bozen-Bolzano; Giuseppe De Giacomo, Sapienza University of Rome; Alin Deutsch, University of California San Diego; Marco Montali, Free University of Bozen-Bolzano
  • Charting the Tractability Frontier of Certain Conjunctive Query Answering
    Jef Wijsen, University of Mons
  • TriAL for RDF: Adapting Graph Query Languages for RDF Data
    Leonid Libkin, University of Edinburgh; Juan L. Reutter, University of Edinburgh; Domagoj Vrgoč, University of Edinburgh
  • Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP
    Meghyn Bienvenu, CNRS University of Paris-Sud; Balder Ten Cate, University of California Santa Cruz; Carsten Lutz; University of Bremen; Frank Wolter, University of Liverpool
  • Well-Founded Semantics for Extended Datalog and Ontological Reasoning
    André Hernich, The Humboldt University of Berlin; Clemens Kupke, University of Oxford; Thomas Lukasiewicz, University of Oxford; Georg Gottlob, University of Oxford
  • Semantic Acyclicity on Graph Databases
    Pablo Barceló, University of Chile; Miguel Romero, University of Chile; Moshe Vardi, Rice University
  • On XPath with Transitive Axes and Data Tests
    Diego Figueira, University of Edinburgh
  • A Trichotomy for Regular Simple Path Queries on Graphs
    Guillaume Bagan, INRIA Lille Nord Europe; Angela Bonifati, Lille 1 University & INRIA;  Benoit Groz, Tel Aviv University
  • Communication Steps for Parallel Query Processing
    Paul Beame, University of Washington; Paraschos Koutris, University of Washington; Dan Suciu, University of Washington
  • A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator
    Limsoon Wong, National University of Singapore
  • Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion
    Wojciech Kazana, INRIA, LSV, ENS-Cachan; Luc Segoufin, INRIA, LSV, ENS-Cachan
  • The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity
    Hubie Chen, The University of the Basque Country and Ikerbasque; Moritz Mueller, University of Vienna