23 citations · 149 across the 34 of their papers we have counts for
3 papers · 1 filter
Efficiently Enumerating Minimal Triangulations
Nofar Carmeli, Batya Kenig, Benny Kimelfeld +1
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper t…
Unambiguous Prioritized Repairing of Databases
Benny Kimelfeld, Ester Livshits, Liat Peterfreund
In its traditional definition, a repair of an inconsistent database is a consistent database that differs from the inconsistent one in a "minimal way". Often, repairs are not equal…
Flexible Caching in Trie Joins
Oren Kalinsky, Yoav Etsion, Benny Kimelfeld
Traditional algorithms for multiway join computation are based on rewriting the order of joins and combining results of intermediate subqueries. Recently, several approaches have b…