activity
20192026
most citedA+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems

9 citations · 19 across the 12 of their papers we have counts for

collaborators

13 papers

cs.AI2026

HARDEN: Constrained Evolutionary Search for Harder, Answer-Preserving Evaluation Cases

Aditya Kumaran, Rahul Singhal, Karime Maamari +2

Language models are often evaluated on curated benchmarks that underrepresent the complexity of enterprise deployments. We introduce HARDEN, a constrained evolutionary search metho…

cs.DB2026

Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations

Sunny Yasser, Anas Dorbani, Amine Mhedhbi

Many-to-many joins are central to analytical and semantic workloads such as fraud detection, network analysis, and recommendation, where insights arise from relationships between e…

cs.DB2026

SQLMorph: Query Mutation and Fine-Grained Metrics for Text-to-SQL Evaluation

Mohammadhossein Malekpour, Mohamed Riahi, Maxime Lamothe +1

Text-to-SQL systems translate natural language queries into executable SQL, democratizing access to structured data. Despite recent advances driven by large language models (LLMs),…

cs.LG2025

Generalization Can Emerge in Tabular Foundation Models From a Single Table

Junwei Ma, Nour Shaheen, Alex Labach +4

Deep tabular modelling increasingly relies on in-context learning where, during inference, a model receives a set of pairs as context and predicts labels for new inputs wit…

cs.HC2025★ 1 cited

Semantic Commit: Helping Users Update Intent Specifications for AI Memory at Scale

Priyan Vaithilingam, Munyeong Kim, Frida-Cecilia Acosta-Parenteau +4

How do we update AI memory of user intent as intent changes? We consider how an AI interface may assist the integration of new information into a repository of natural language dat…

physics.med-ph2025

A novel methodology to estimate pileup effects and induced error in microdosimetric spectra

E. Pierobon, M. Missiaggia, F. G. Cordoni +1

Microdosimetry provides a superior characterization of the radiation field compared to conventional LET-based methodology, and for this reason it has become increasingly attractive…

cs.AI2025

GenEdit: Compounding Operators and Continuous Improvement to Tackle Text-to-SQL in the Enterprise

Karime Maamari, Connor Landy, Amine Mhedhbi

Recent advancements in Text-to-SQL, driven by large language models, are democratizing data access. Despite these advancements, enterprise deployments remain challenging due to the…

cs.DB2024★ 2 cited

Towards Optimizing SQL Generation via LLM Routing

Mohammadhossein Malekpour, Nour Shaheen, Foutse Khomh +1

Text-to-SQL enables users to interact with databases through natural language, simplifying access to structured data. Although highly capable large language models (LLMs) achieve s…

cs.CL2024★ 5 cited

The Death of Schema Linking? Text-to-SQL in the Age of Well-Reasoned Language Models

Karime Maamari, Fadhil Abubaker, Daniel Jaroslawicz +1

Schema linking is a crucial step in Text-to-SQL pipelines. Its goal is to retrieve the relevant tables and columns of a target database for a user's query while disregarding irrele…

cs.CL2024★ 1 cited

End-to-end Text-to-SQL Generation within an Analytics Insight Engine

Karime Maamari, Amine Mhedhbi

Recent advancements in Text-to-SQL have pushed database management systems towards greater democratization of data access. Today's language models are at the core of these advancem…

cs.DB2021★ 1 cited

Columnar Storage and List-based Processing for Graph Database Management Systems

Pranjal Gupta, Amine Mhedhbi, Semih Salihoglu

We revisit column-oriented storage and query processing techniques in the context of contemporary graph database management systems (GDBMSs). Similar to column-oriented RDBMSs, GDB…

cs.DB2020★ 9 cited

A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems

Amine Mhedhbi, Pranjal Gupta, Shahid Khaliq +1

Graph database management systems (GDBMSs) are highly optimized to perform fast traversals, i.e., joins of vertices with their neighbours, by indexing the neighbourhoods of vertice…

cs.DB2019

Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins

Amine Mhedhbi, Semih Salihoglu

We study the problem of optimizing subgraph queries using the new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time us…