no code implementations • 27 Feb 2024 • Michael Toker, Oren Mishali, Ophir Münz-Manor, Benny Kimelfeld, Yonatan Belinkov
There is a large volume of late antique and medieval Hebrew texts.
no code implementations • 20 Jan 2024 • Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld
We study the embedding of the tuples of a relational database, where existing techniques are often based on optimization tasks over a collection of random walks from the database.
1 code implementation • 13 Dec 2023 • Alon Mor, Yonatan Belinkov, Benny Kimelfeld
% We devise techniques for accelerating the global aggregation of the Anchor algorithm.
1 code implementation • 11 Mar 2021 • Jan Toenshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld
We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database.
Knowledge Graphs Databases
no code implementations • 29 Jan 2021 • Aviram Imber, Benny Kimelfeld
We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain.
Computer Science and Game Theory Computational Complexity
no code implementations • 22 Dec 2020 • Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
For each of the two problems, we give a decidable characterization (under conventional complexity assumptions) of the class of tractable lexicographic orders for every CQ without self-joins.
Databases Data Structures and Algorithms
no code implementations • 18 May 2020 • Aviram Imber, Benny Kimelfeld
When voter preferences are known in an incomplete manner as partial orders, a candidate can be a possible/necessary winner based on the possibilities of completing the partial votes.
Computer Science and Game Theory Computational Complexity
no code implementations • 5 Feb 2020 • Elad Kravi, Benny Kimelfeld, Yaron Kanza, Roi Reichart
We explore two approaches to the problem: (a) a pipeline approach, where each message is first classified, and then the location associated with the message set is inferred from the individual message labels; and (b) a joint approach where the individual messages are simultaneously processed to yield the desired location type.
no code implementations • 10 May 2018 • Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich
At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries.
no code implementations • 28 Feb 2016 • Oren Kalinsky, Yoav Etsion, Benny Kimelfeld
An important advantage of LFTJ is its small memory footprint, due to the fact that intermediate results are full tuples that can be dumped immediately.
Databases
no code implementations • 6 Dec 2014 • Vince Barany, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena
By virtue of extending Datalog, our framework offers a natural integration with the database, and has a robust declarative semantics.