default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st ICDT 2018: Vienna, Austria
- Benny Kimelfeld, Yael Amsterdamer:
21st International Conference on Database Theory, ICDT 2018, March 26-29, 2018, Vienna, Austria. LIPIcs 98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-063-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Virginia Vassilevska Williams:
Fine-grained Algorithms and Complexity. 1:1-1:1 - Ke Yi:
Join Algorithms: From External Memory to the BSP. 2:1-2:1 - Thomas Zeume:
An Update on Dynamic Complexity Theory. 3:1-3:1 - Shqiponja Ahmetaj
, Magdalena Ortiz, Mantas Simkus:
Rewriting Guarded Existential Rules into Small Datalog Programs. 4:1-4:24 - Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
Enumeration on Trees under Relabelings. 5:1-5:18 - Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Connecting Width and Structure in Knowledge Compilation. 6:1-6:17 - Pablo Barceló, Miguel Romero, Thomas Zeume:
A More General Theory of Static Approximations for Conjunctive Queries. 7:1-7:22 - Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering UCQs under Updates and in the Presence of Integrity Constraints. 8:1-8:19 - Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Guohui Xiao:
Expressivity and Complexity of MongoDB Queries. 9:1-9:23 - Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the Expressive Power of Query Languages for Matrices. 10:1-10:17 - Nofar Carmeli, Markus Kröll:
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. 11:1-11:17 - David Carral, Markus Krötzsch, Maximilian Marx, Ana Ozaki, Sebastian Rudolph:
Preserving Constraints with the Stable Chase. 12:1-12:19 - Graham Cormode, Jacques Dark:
Fast Sketch-based Recovery of Correlation Outliers. 13:1-13:18 - Johannes Doleschal, Wim Martens, Frank Neven, Adam Witkowski:
Satisfiability for SCULPT-Schemas for CSV-Like Data. 14:1-14:19 - Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Querying the Unary Negation Fragment with Regular Path Expressions. 15:1-15:18 - Ahmet Kara, Dan Olteanu:
Covers of Query Results. 16:1-16:22 - Bas Ketsman, Aws Albarghouthi, Paraschos Koutris:
Distribution Policies for Datalog. 17:1-17:22 - Bas Ketsman, Frank Neven, Brecht Vandevoort:
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics. 18:1-18:16 - Wim Martens, Tina Trautner:
Evaluation and Enumeration Problems for Regular Path Queries. 19:1-19:21 - Yufei Tao:
Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space. 20:1-20:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-31 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
