Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Keppeler, Jens"'
The paper studies query evaluation in parallel constant time in the PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time on an appropriate CRCW-PRAM, this paper is interested in the efficiency of ev
Externí odkaz:
http://arxiv.org/abs/2301.08178
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (November 29, 2023) lmcs:10166
The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases where the qu
Externí odkaz:
http://arxiv.org/abs/2201.05129
Autor:
Keppeler, Jens
In dieser Arbeit wird das dynamische Auswertungsproblem über dynamische Datenbanken betrachtet, bei denen Tupel hinzugefügt oder gelöscht werden können. Die Aufgabe besteht darin einen dynamischen Algorithmus zu konstruieren, welcher unmittelbar
Externí odkaz:
http://edoc.hu-berlin.de/18452/22264
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 that can immediately report the new result of a fixed query after every
Externí odkaz:
http://arxiv.org/abs/1709.10039
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 immediately reports the new result of a fixed query after every databa
Externí odkaz:
http://arxiv.org/abs/1702.08764
We consider the task of enumerating and counting answers to $k$-ary conjunctive queries against relational databases that may be updated by inserting or deleting tuples. We exhibit a new notion of q-hierarchical conjunctive queries and show that thes
Externí odkaz:
http://arxiv.org/abs/1702.06370
Publikováno v:
Logical Methods in Computer Science (LMCS); 2023, Vol. 19 Issue 4, p1-35, 35p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.