Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Geck, Gaetano"'
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:
Geck, Gaetano, Quenkert, Christine, Schmellenkamp, Marko, Schmidt, Jonas, Tschirbs, Felix, Vehlken, Fabian, Zeume, Thomas
The Iltis project provides an interactive, web-based system for teaching the foundations of formal methods. It is designed with the objective to allow for simple inclusion of new educational tasks; to pipeline such tasks into more complex exercises;
Externí odkaz:
http://arxiv.org/abs/2105.05763
This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating dependencie
Externí odkaz:
http://arxiv.org/abs/2003.00965
Autor:
Geck, Gaetano, Ljulin, Artur, Peter, Sebastian, Schmidt, Jonas, Vehlken, Fabian, Zeume, Thomas
Logic is a foundation for many modern areas of computer science. In artificial intelligence, as a basis of database query languages, as well as in formal software and hardware verification --- modelling scenarios using logical formalisms and inferrin
Externí odkaz:
http://arxiv.org/abs/1804.03579
Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computi
Externí odkaz:
http://arxiv.org/abs/1512.06246
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers
Externí odkaz:
http://arxiv.org/abs/1412.4030
Reasoning on Data Partitioning for Single-Round Multi-Join Evaluation in Massively Parallel Systems.
Autor:
Ameloot, Tom J.1,2 (AUTHOR) tom.ameloot@uhasselt.be, Geck, Gaetano3 (AUTHOR) gaetano.geck@udo.edu, Ketsman, Bas2,4 (AUTHOR) bas.ketsman@uhasselt.be, Neven, Frank2 (AUTHOR) frank.neven@uhasselt.be, Schwentick, Thomas3 (AUTHOR) thomas.schwentick@udo.edu
Publikováno v:
Communications of the ACM. Mar2017, Vol. 60 Issue 3, p93-100. 8p. 3 Diagrams.
Publikováno v:
Logical Methods in Computer Science (LMCS); 2023, Vol. 19 Issue 4, p1-35, 35p
Autor:
Geck, Gaetano
Large data sets are often stored distributedly to increase the reliability of systems and the efficiency of query evaluation in them. While some query operators -- like selections and projections -- are intrinsically conform with parallel evaluation,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0448ad91a32a0d792ed38aa02568ab1e
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.