Six lab papers accepted to PODS 2019

paper

In addition to the three lab papers announced earlier, three more were accepted to PODS 2019.

Lot's of excitement in the lab!

Papers

  1. On the Enumeration Complexity of Unions of Conjunctive Queries

    Nofar Carmeli, Markus Kröll

    PODS 2019: 134-148

    Enumeration Algorithms Query Optimization

  2. Complexity Bounds for Relational Algebra over Document Spanners

    Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll, Liat Peterfreund

    PODS 2019: 320-334

    Text Analysis

  3. Query Evaluation in Election Databases

    Benny Kimelfeld, Phokion G. Kolaitis, Muhammad Tibi

    PODS 2019: 32-46

    Preference Data Management