22 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université de LilleFR9 papers
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR7 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- École Centrale de LilleFR4 papers
- Laboratoire Traitement et Communication de l’InformationFR4 papers
- Centre de Recherche en InformatiqueFR3 papers
- Télécom ParisFR3 papers
- Centre Inria de l'Université de LilleFR2 papers
- Laboratoire d'Informatique Fondamentale de LilleFR2 papers
- University of OxfordGB2 papers
- Centre de Recherche en Informatique de LensFR1 paper
6 papers · 1 filter
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…
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:…
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)
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 introduce a new Datalog frag…
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…
XPath Node Selection over Grammar-Compressed Trees
Sebastian Maneth, Tom Sebastian
XML document markup is highly repetitive and therefore well compressible using grammar-based compression. Downward, navigational XPath can be executed over grammar-compressed trees…
Simple Schemas for Unordered XML
Iovka Boneva, Radu Ciucanu, Slawek Staworko
We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and i…