output
20132022
most citedA Circuit-Based Approach to Efficient Enumeration

22 citations

Showing cs.DBShow all

6 papers · 1 filter

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.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.DB2017★ 3 cited

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…

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…

cs.DB2013★ 3 cited

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…

cs.DB2013★ 8 cited

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…