Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th ICDT 2022: Edinburgh, UK (Virtual Conference)
- Dan Olteanu, Nils Vortmeier:
25th International Conference on Database Theory, ICDT 2022, March 29 to April 1, 2022, Edinburgh, UK (Virtual Conference). LIPIcs 220, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-223-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Hung Q. Ngo:
On an Information Theoretic Approach to Cardinality Estimation (Invited Talk). 1:1-1:21 - Marcelo Arenas:
Counting the Solutions to a Query (Invited Talk). 2:1-2:1 - Nofar Carmeli:
Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk). 3:1-3:1 - Shay Gershtein, Uri Avron, Ido Guy, Tova Milo, Slava Novgorodov:
On the Hardness of Category Tree Construction. 4:1-4:17 - Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Queries. 5:1-5:19 - Austen Z. Fan, Paraschos Koutris:
Certifiable Robustness for Nearest Neighbor Classifiers. 6:1-6:20 - Raghavendra Addanki, Andrew McGregor, Alexandra Meliou, Zafeiria Moumoulidou:
Improved Approximation and Scalability for Fair Max-Min Diversification. 7:1-7:21 - Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Rewriting with Acyclic Queries: Mind Your Head. 8:1-8:20 - Yufei Tao
:
Parallel Acyclic Joins with Canonical Edge Covers. 9:1-9:19 - Dominik D. Freydenberger, Sam M. Thompson:
Splitting Spanner Atoms: A Tool for Acyclic Core Spanners. 10:1-10:18 - Martin Raszyk, David A. Basin, Srdan Krstic, Dmitriy Traytel:
Practical Relational Calculus Query Evaluation. 11:1-11:21 - Cristina Feier:
Characterising Fixed Parameter Tractability for Query Evaluation over Guarded TGDs. 12:1-12:20 - Maximilian Marx, Markus Krötzsch:
Tuple-Generating Dependencies Capture Complex Values. 13:1-13:20 - Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek:
Inference of Shape Graphs for Graph Databases. 14:1-14:20 - Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Expressiveness of SHACL Features. 15:1-15:16 - Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness Against Read Committed for Transaction Templates with Functional Constraints. 16:1-16:17 - Jingfan Meng, Huayi Wang, Jun Xu, Mitsunori Ogihara:
A Dyadic Simulation Approach to Efficient Range-Summability. 17:1-17:18 - Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich:
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. 18:1-18:21 - Martin Muñoz, Cristian Riveros:
Streaming Enumeration on Nested Documents. 19:1-19:18
a service of 
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-07-02 21:45 CEST 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:
