75 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR29 papers
- Centre Inria de l'Université de LilleFR18 papers
- Centre National de la Recherche ScientifiqueFR15 papers
- Université de LilleFR12 papers
- École Polytechnique Fédérale de LausanneCH6 papers
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR4 papers
- Laboratoire d'Informatique, Signaux et Systèmes de Sophia AntipolisFR3 papers
- Universidad de SevillaES3 papers
- Université Côte d'AzurFR3 papers
- Carnegie Mellon UniversityUS2 papers
- Dynamic Imaging (United Kingdom)GB2 papers
- École Centrale de LilleFR2 papers
6 papers · 1 filter
Query Containment for Highly Expressive Datalog Fragments
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
The containment problem of Datalog queries is well known to be undecidable. There are, however, several Datalog fragments for which containment is known to be decidable, most notab…
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…
Semantic Query Reformulation in Social PDMS
Angela Bonifati, Gianvito Summa, Esther Pacitti +1
We consider social peer-to-peer data management systems (PDMS), where each peer maintains both semantic mappings between its schema and some acquaintances, and social links with pe…
Fast and Tiny Structural Self-Indexes for XML
Sebastian Maneth, Tom Sebastian
XML document markup is highly repetitive and therefore well compressible using dictionary-based methods such as DAGs or grammars. In the context of selectivity estimation, grammar-…
Prioritized Repairing and Consistent Query Answering in Relational Databases
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski
A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Oft…