output
20132026
most citedModulating early visual processing by language

298 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DBShow all

14 papers · 1 filter

cs.DB2025★ 5 cited

Common Foundations for SHACL, ShEx, and PG-Schema

S. Ahmetaj, I. Boneva, J. Hidders +11

Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks,…

cs.DB2024★ 21 cited

The Shapley Value in Database Management

Leopoldo Bertossi, Benny Kimelfeld, Ester Livshits +1

Attribution scores can be applied in data management to quantify the contribution of individual items to conclusions from the data, as part of the explanation of what led to these…

cs.DB2023★ 1 cited

Static Analysis of Graph Database Transformations

Iovka Boneva, Benoit Groz, Jan Hidders +2

We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental stat…

cs.DB2022★ 77 cited

PG-Schema: Schemas for Property Graphs

Renzo Angles, Angela Bonifati, Stefania Dumbrava +18

Property graphs have reached a high level of maturity, witnessed by multiple robust graph database systems as well as the ongoing ISO standardization effort aiming at creating a ne…

cs.DB2022★ 1 cited

Linear Programs with Conjunctive Database Queries

Florent Capelli, Nicolas Crosetti, Joachim Niehren +1

In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language LP(CQ) for specifying li…

cs.DB2020

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries

Pierre Bourhis, Daniel Deutch, Yuval Moskovitch

The algebraic approach for provenance tracking, originating in the semiring model of Green et. al, has proven useful as an abstract way of handling metadata. Commutative Semirings…

cs.DB2020

Constant-Delay Enumeration for Nondeterministic Document Spanners

Antoine Amarilli, Pierre Bourhis, Stefan Mengel +1

We consider the information extraction framework known as document spanners, and study the problem of efficiently computing the results of the extraction from an input document, wh…

cs.DB2018★ 11 cited

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

Antoine Amarilli, Pierre Bourhis, Stefan Mengel +1

We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the…

cs.DB2018★ 14 cited

Connecting Knowledge Compilation Classes and Width Parameters

Antoine Amarilli, Florent Capelli, Mikaël Monet +1

The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structure…

cs.DB2018★ 1 cited

Evaluating Datalog via Tree Automata and Cycluits

Antoine Amarilli, Pierre Bourhis, Mikaël Monet +1

We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-gu…

cs.DB2018★ 4 cited

Relational to RDF Data Exchange in Presence of a Shape Expression Schema

Iovka Boneva, Jose Lozano, Sławek Staworko

We study the relational to RDF data exchange problem, where the tar- get constraints are specified using Shape Expression schema (ShEx). We investi- gate two fundamental problems:…

cs.DB2016★ 11 cited

Tractable Lineages on Treelike Instances: Limits and Extensions

Antoine Amarilli, Pierre Bourhis, Pierre Senellart

Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them…

cs.DB2015★ 44 cited

Provenance Circuits for Trees and Treelike Instances (Extended Version)

Antoine Amarilli, Pierre Bourhis, Pierre Senellart

Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been…

cs.DB2015★ 2 cited

Shape Expressions Schemas

Iovka Boneva, Jose E. Labra Gayo, Eric G. Prud'hommeaux +1

We present Shape Expressions (ShEx), an expressive schema language for RDF designed to provide a high-level, user friendly syntax with intuitive semantics. ShEx allows to describe…