Dagstuhl Follow-Ups, Volume 5
Editors: Phokion G. Kolaitis, Maurizio Lenzerini, and Nicole Schweikardt
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Benjamin Scheidt and Nicole Schweikardt. Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 79:1-79:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{scheidt_et_al:LIPIcs.MFCS.2023.79, author = {Scheidt, Benjamin and Schweikardt, Nicole}, title = {{Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {79:1--79:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.79}, URN = {urn:nbn:de:0030-drops-186131}, doi = {10.4230/LIPIcs.MFCS.2023.79}, annote = {Keywords: counting logics, guarded logics, homomorphism counting, hypertree decompositions, hypergraphs, incidence graphs, quantum graphs} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Martín Muñoz and Cristian Riveros. Constant-Delay Enumeration for SLP-Compressed Documents. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{munoz_et_al:LIPIcs.ICDT.2023.7, author = {Mu\~{n}oz, Mart{\'\i}n and Riveros, Cristian}, title = {{Constant-Delay Enumeration for SLP-Compressed Documents}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.7}, URN = {urn:nbn:de:0030-drops-177495}, doi = {10.4230/LIPIcs.ICDT.2023.7}, annote = {Keywords: SLP compression, query evaluation, enumeration algorithms} }
Published in: LIPIcs, Volume 220, 25th International Conference on Database Theory (ICDT 2022)
Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, and Matthias Weidlich. Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. In 25th International Conference on Database Theory (ICDT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 220, pp. 18:1-18:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kleestmeiner_et_al:LIPIcs.ICDT.2022.18, author = {Kleest-Mei{\ss}ner, Sarah and Sattler, Rebecca and Schmid, Markus L. and Schweikardt, Nicole and Weidlich, Matthias}, title = {{Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints}}, booktitle = {25th International Conference on Database Theory (ICDT 2022)}, pages = {18:1--18:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-223-5}, ISSN = {1868-8969}, year = {2022}, volume = {220}, editor = {Olteanu, Dan and Vortmeier, Nils}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.18}, URN = {urn:nbn:de:0030-drops-158922}, doi = {10.4230/LIPIcs.ICDT.2022.18}, annote = {Keywords: event queries on traces, pattern queries on strings, learning descriptive queries, complexity of query evaluation and query learning} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Markus L. Schmid and Nicole Schweikardt. A Purely Regular Approach to Non-Regular Core Spanners. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{schmid_et_al:LIPIcs.ICDT.2021.4, author = {Schmid, Markus L. and Schweikardt, Nicole}, title = {{A Purely Regular Approach to Non-Regular Core Spanners}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.4}, URN = {urn:nbn:de:0030-drops-137124}, doi = {10.4230/LIPIcs.ICDT.2021.4}, annote = {Keywords: Document spanners, regular expressions with backreferences} }
Published in: LIPIcs, Volume 183, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Steffen van Bergerem and Nicole Schweikardt. Learning Concepts Described By Weight Aggregation Logic. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 183, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{vanbergerem_et_al:LIPIcs.CSL.2021.10, author = {van Bergerem, Steffen and Schweikardt, Nicole}, title = {{Learning Concepts Described By Weight Aggregation Logic}}, booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-175-7}, ISSN = {1868-8969}, year = {2021}, volume = {183}, editor = {Baier, Christel and Goubault-Larrecq, Jean}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.10}, URN = {urn:nbn:de:0030-drops-134447}, doi = {10.4230/LIPIcs.CSL.2021.10}, annote = {Keywords: first-order definable concept learning, agnostic probably approximately correct learning, classification problems, locality, Feferman-Vaught decomposition, Gaifman normal form, first-order logic with counting, weight aggregation logic} }
Published in: Dagstuhl Reports, Volume 9, Issue 5 (2019)
Endre Boros, Benny Kimelfeld, Reinhard Pichler, and Nicole Schweikardt. Enumeration in Data Management (Dagstuhl Seminar 19211). In Dagstuhl Reports, Volume 9, Issue 5, pp. 89-109, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{boros_et_al:DagRep.9.5.89, author = {Boros, Endre and Kimelfeld, Benny and Pichler, Reinhard and Schweikardt, Nicole}, title = {{Enumeration in Data Management (Dagstuhl Seminar 19211)}}, pages = {89--109}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {5}, editor = {Boros, Endre and Kimelfeld, Benny and Pichler, Reinhard and Schweikardt, Nicole}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.5.89}, URN = {urn:nbn:de:0030-drops-113822}, doi = {10.4230/DagRep.9.5.89}, annote = {Keywords: constant delay, databases, dynamic complexity, enumeration, polynomial delay, query evaluation} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Christoph Berkholz and Nicole Schweikardt. Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 58:1-58:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{berkholz_et_al:LIPIcs.MFCS.2019.58, author = {Berkholz, Christoph and Schweikardt, Nicole}, title = {{Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {58:1--58:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.58}, URN = {urn:nbn:de:0030-drops-110021}, doi = {10.4230/LIPIcs.MFCS.2019.58}, annote = {Keywords: conjunctive queries, constant delay enumeration, hypertree decompositions, submodular width, fixed-parameter tractability} }
Published in: LIPIcs, Volume 127, 22nd International Conference on Database Theory (ICDT 2019)
Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. Counting Triangles under Updates in Worst-Case Optimal Time. In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kara_et_al:LIPIcs.ICDT.2019.4, author = {Kara, Ahmet and Ngo, Hung Q. and Nikolic, Milos and Olteanu, Dan and Zhang, Haozhe}, title = {{Counting Triangles under Updates in Worst-Case Optimal Time}}, booktitle = {22nd International Conference on Database Theory (ICDT 2019)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-101-6}, ISSN = {1868-8969}, year = {2019}, volume = {127}, editor = {Barcelo, Pablo and Calautti, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.4}, URN = {urn:nbn:de:0030-drops-103068}, doi = {10.4230/LIPIcs.ICDT.2019.4}, annote = {Keywords: incremental view maintenance, amortized analysis, data skew} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Dietrich Kuske and Nicole Schweikardt. Gaifman Normal Forms for Counting Extensions of First-Order Logic. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 133:1-133:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kuske_et_al:LIPIcs.ICALP.2018.133, author = {Kuske, Dietrich and Schweikardt, Nicole}, title = {{Gaifman Normal Forms for Counting Extensions of First-Order Logic}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {133:1--133:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.133}, URN = {urn:nbn:de:0030-drops-91375}, doi = {10.4230/LIPIcs.ICALP.2018.133}, annote = {Keywords: Finite model theory, Gaifman locality, modulo-counting quantifiers, fixed parameter tractable model-checking} }
Published in: LIPIcs, Volume 98, 21st International Conference on Database Theory (ICDT 2018)
Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering UCQs under Updates and in the Presence of Integrity Constraints. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{berkholz_et_al:LIPIcs.ICDT.2018.8, author = {Berkholz, Christoph and Keppeler, Jens and Schweikardt, Nicole}, title = {{Answering UCQs under Updates and in the Presence of Integrity Constraints}}, booktitle = {21st International Conference on Database Theory (ICDT 2018)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-063-7}, ISSN = {1868-8969}, year = {2018}, volume = {98}, editor = {Kimelfeld, Benny and Amsterdamer, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.8}, URN = {urn:nbn:de:0030-drops-85990}, doi = {10.4230/LIPIcs.ICDT.2018.8}, annote = {Keywords: dynamic query evaluation, union of conjunctive queries, constant-delay enumeration, counting problem, testing} }
Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)
Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering FO+MOD Queries Under Updates on Bounded Degree Databases. In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{berkholz_et_al:LIPIcs.ICDT.2017.8, author = {Berkholz, Christoph and Keppeler, Jens and Schweikardt, Nicole}, title = {{Answering FO+MOD Queries Under Updates on Bounded Degree Databases}}, booktitle = {20th International Conference on Database Theory (ICDT 2017)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-024-8}, ISSN = {1868-8969}, year = {2017}, volume = {68}, editor = {Benedikt, Michael and Orsi, Giorgio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.8}, URN = {urn:nbn:de:0030-drops-70535}, doi = {10.4230/LIPIcs.ICDT.2017.8}, annote = {Keywords: dynamic databases, query enumeration, counting problem, first-order logic with modulo-counting quantifiers, Hanf locality} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Nicole Schweikardt. Using Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk). In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 13-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{schweikardt:LIPIcs.ICDT.2015.13, author = {Schweikardt, Nicole}, title = {{Using Locality for Efficient Query Evaluation in Various Computation Models}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {13--14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.13}, URN = {urn:nbn:de:0030-drops-49987}, doi = {10.4230/LIPIcs.ICDT.2015.13}, annote = {Keywords: query evaluation, locality} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Frank Neven, Nicole Schweikardt, Frédéric Servais, and Tony Tan. Distributed Streaming with Finite Memory. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 324-341, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{neven_et_al:LIPIcs.ICDT.2015.324, author = {Neven, Frank and Schweikardt, Nicole and Servais, Fr\'{e}d\'{e}ric and Tan, Tony}, title = {{Distributed Streaming with Finite Memory}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {324--341}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.324}, URN = {urn:nbn:de:0030-drops-49939}, doi = {10.4230/LIPIcs.ICDT.2015.324}, annote = {Keywords: distributed systems, relational algebra, semijoin algebra, register automata, register transducers.} }
Published in: Dagstuhl Follow-Ups, Volume 5, Data Exchange, Integration, and Streams (2013)
Data Exchange, Integration, and Streams. Dagstuhl Follow-Ups, Volume 5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Collection{DFU.Vol5.10452, title = {{DFU, Volume 5, Data Exchange, Integration, and Streams, Complete Volume}}, booktitle = {Data Exchange, Integration, and Streams}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-61-3}, ISSN = {1868-8977}, year = {2013}, volume = {5}, editor = {Kolaitis, Phokion G. and Lenzerini, Maurizio and Schweikardt, Nicole}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol5.10452}, URN = {urn:nbn:de:0030-drops-43032}, doi = {10.4230/DFU.Vol5.10452}, annote = {Keywords: Heterogeneous Databases, Systems, Database Applications, Nonnumerical Algorithms and Problems} }
Feedback for Dagstuhl Publishing