output
20052025
most citedBest-Arm Identification in Linear Bandits

75 citations

Showing cs.DBShow all

6 papers · 1 filter

cs.DB2014★ 6 cited

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…

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…

cs.DB2011★ 1 cited

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…

cs.DB2010★ 1 cited

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-…

cs.DB2009★ 1 cited

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…