April 8, 2025, 1:52 p.m.
Two papers accepted to PODS 2025
Two papers of our scientists has been accepted at the ACM SIGMOD/PODS International Conference on Management of Data, which will take place in June in Berlin.
In the paper Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration, Paweł Gawrychowski, together with Florin Manea and Markus L. Schmid, presented a simpler and faster algorithm for finding the best matches of a given regular expression in a text.
Meanwhile, Piotr Ostropolski-Nalewaja, along with Lucas Larroque and Michaël Thomazo, published the paper No Cliques Allowed: The Next Step Towards BDD/FC Conjecture. The paper concerns existential rules, and its main goal is to create a foothold—in the form of a set of new proof techniques—to tackle the BDD/FC conjecture. This is one of the most well-known open problems concerning existential rules. The conjecture relates to the question of whether certain very elegant algorithms developed for infinite structures also apply to practical cases, i.e., whether they retain their properties in the context of databases.
