In this research, we aim to develop techniques for optimizing query evaluation over databases of various types, from traditional relational models to ones entailed in text analytics. Our focus is on “compilation” techniques that translate queries into different formalisms that are associated with algorithms and complexity guarantees.
Nofar Carmeli, Markus Kröll, "Enumeration Complexity of Conjunctive Queries with Functional Dependencies"
, ICDT 2018: 11:1-11:17 abstractpaper
Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund, "Joining Extractions of Regular Expressions"
, PODS 2018: 137-149 abstractpaper
Oren Kalinsky, Yoav Etsion, Benny Kimelfeld, "Flexible Caching in Trie Joins"
, EDBT 2017: 282-293 abstractpaper