6 citations · 7 across the 4 of their papers we have counts for
5 papers
Work-Efficient Query Evaluation in Constant Time with PRAMs
Jens Keppeler, Thomas Schwentick, Christopher Spinrath
The article studies query evaluation in parallel constant time in the CRCW PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time…
Rewriting with Acyclic Queries: Mind Your Head
Gaetano Geck, Jens Keppeler, Thomas Schwentick +1
The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query and a set of views, there is a conjunctive query $Q'…
Answering UCQs under updates and in the presence of integrity constraints
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
We investigate the query evaluation problem for fixed queries over fully dynamic databases where tuples can be inserted or deleted. The task is to design a dynamic data structure t…
Answering FO+MOD queries under updates on bounded degree databases
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that…
Answering Conjunctive Queries under Updates
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
We consider the task of enumerating and counting answers to -ary conjunctive queries against relational databases that may be updated by inserting or deleting tuples. We exhibit…