Nofar Carmeli

45 papers A* 9A 4Journal 27Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Direct Access for Conjunctive Queries with Negations.
Log. Methods Comput. Sci.
Florent Capelli, Nofar Carmeli, Oliver Irwin, Sylvain Salvati
2026 J jnl
Let's Play Tag: Linear Time Evaluation of Conjunctive Queries under TGD Constraints.
CoRR
Nofar Carmeli, Carsten Lutz, Marcin Przybylko
2026 J jnl
Tuple-Independent Representations of Infinite Probabilistic Databases.
ACM Trans. Database Syst.
Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2025 J jnl
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum.
CoRR
Nofar Carmeli, Nikolaos Tziavelis
2025 J jnl
PACMMOD, V3, N2 (PODS), May 2025 Editorial.
Proc. ACM Manag. Data
Nofar Carmeli, Floris Geerts, Ahmet Kara, Benny Kimelfeld
2025 J jnl
Tight Fine-Grained Bounds for Direct Access on Join Queries.
ACM Trans. Database Syst.
Karl Bringmann, Nofar Carmeli, Stefan Mengel
2025 J jnl
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries.
Log. Methods Comput. Sci.
Karl Bringmann, Nofar Carmeli
2024 J jnl
Database Repairing with Soft Functional Dependencies.
ACM Trans. Database Syst.
Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2024 A conf
Direct Access for Answers to Conjunctive Queries with Aggregation.
ICDT
Idan Eldar, Nofar Carmeli, Benny Kimelfeld
2024 J jnl
PACMMOD, V2, N5 (PODS), November 2024 Editorial.
Proc. ACM Manag. Data
Nofar Carmeli, Floris Geerts, Benny Kimelfeld
2023 — conf
Accessing Answers to Conjunctive Queries with Ideal Time Guarantees (Abstract of Invited Talk).
Description Logics
Nofar Carmeli
2023 — conf
Answering Aggregate Queries with Ordered Direct Access (short paper).
AMW
Idan Eldar, Nofar Carmeli, Benny Kimelfeld
2023 A* conf
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis.
PODS
Nofar Carmeli, Luc Segoufin
2023 J jnl
Direct Access for Answers to Conjunctive Queries with Aggregation.
CoRR
Idan Eldar, Nofar Carmeli, Benny Kimelfeld
2023 A* conf
Efficient Computation of Quantiles over Joins.
PODS
Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2023 J jnl
Efficient Computation of Quantiles over Joins.
CoRR
Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2023 J jnl
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
ACM Trans. Database Syst.
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2022 J jnl
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
ACM Trans. Database Syst.
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Alessio Conte, Benny Kimelfeld, Nicole Schweikardt
2022 A conf
Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk).
ICDT
Nofar Carmeli
2022 J jnl
Conjunctive queries with self-joins, towards a fine-grained complexity analysis.
CoRR
Nofar Carmeli, Luc Segoufin
2022 A* conf
Tight Fine-Grained Bounds for Direct Access on Join Queries.
PODS
Karl Bringmann, Nofar Carmeli, Stefan Mengel
2022 J jnl
Tight Fine-Grained Bounds for Direct Access on Join Queries.
CoRR
Karl Bringmann, Nofar Carmeli, Stefan Mengel
2022 J jnl
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries.
CoRR
Karl Bringmann, Nofar Carmeli
2021 A* conf
Constructing Explainable Opinion Graphs from Reviews.
WWW
Nofar Carmeli, Xiaolan Wang, Yoshihiko Suhara, Stefanos Angelidis, Yuliang Li, Jinfeng Li, Wang-Chiew Tan
2021 A conf
Database Repairing with Soft Functional Dependencies.
ICDT
Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2021 J jnl
Efficiently enumerating minimal triangulations.
Discret. Appl. Math.
Nofar Carmeli, Batya Kenig, Benny Kimelfeld, Markus Kröll
2021 J jnl
On the Enumeration Complexity of Unions of Conjunctive Queries.
ACM Trans. Database Syst.
Nofar Carmeli, Markus Kröll
2021 A* conf
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
PODS
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2021 A* conf
Tuple-Independent Representations of Infinite Probabilistic Databases.
PODS
Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2020 A* conf
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
PODS
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
2020 J jnl
Database Repairing with Soft Functional Dependencies.
CoRR
Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2020 J jnl
Enumeration Complexity of Conjunctive Queries with Functional Dependencies.
Theory Comput. Syst.
Nofar Carmeli, Markus Kröll
2020 J jnl
ExplainIt: Explainable Review Summarization with Opinion Causality Graphs.
CoRR
Nofar Carmeli, Xiaolan Wang, Yoshihiko Suhara, Stefanos Angelidis, Yuliang Li, Jinfeng Li, Wang-Chiew Tan
2020 — conf
ExtremeReader: An interactive explorer for customizable and explainable review summarization.
WWW (Companion Volume)
Xiaolan Wang, Yoshihiko Suhara, Natalie Nuno, Yuliang Li, Jinfeng Li, Nofar Carmeli, Stefanos Angelidis, Eser Kandogann, Wang-Chiew Tan
2020 — —
The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries.
Nofar Carmeli
2020 J jnl
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
CoRR
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2020 J jnl
Tuple-Independent Representations of Infinite Probabilistic Databases.
CoRR
Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2019 J jnl
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
CoRR
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
2019 A* conf
On the Enumeration Complexity of Unions of Conjunctive Queries.
PODS
Nofar Carmeli, Markus Kröll
2018 A conf
Enumeration Complexity of Conjunctive Queries with Functional Dependencies.
ICDT
Nofar Carmeli, Markus Kröll
2018 J jnl
Enumeration Complexity of Unions of Conjunctive Queries.
CoRR
Nofar Carmeli, Markus Kröll
2017 A* conf
Efficiently Enumerating Minimal Triangulations.
PODS
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2017 J jnl
Enumeration Complexity of Conjunctive Queries with Functional Dependencies.
CoRR
Nofar Carmeli, Markus Kröll
2016 — conf
On the Enumeration of Tree Decompositions.
AMW
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2016 J jnl
On the Enumeration of all Minimal Triangulations.
CoRR
Nofar Carmeli, Batya Kenig, Benny Kimelfeld