default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th ICDT 2023: Ioannina, Greece
- Floris Geerts, Brecht Vandevoort:
26th International Conference on Database Theory, ICDT 2023, March 28-31, 2023, Ioannina, Greece. LIPIcs 255, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-270-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault
, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
A Researcher's Digest of GQL (Invited Talk). 1:1-1:22 - Gonzalo Navarro:
Compact Data Structures Meet Databases (Invited Talk). 2:1-2:16 - C. Seshadhri:
Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). 3:1-3:10 - Shiyuan Deng, Francesco Silvestri, Yufei Tao:
Enumerating Subgraphs of Constant Sizes in External Memory. 4:1-4:20 - Pavel Raykov:
An Optimal Algorithm for Sliding Window Order Statistics. 5:1-5:13 - Shiyuan Deng, Shangqi Lu, Yufei Tao:
Space-Query Tradeoffs in Range Subgraph Counting and Listing. 6:1-6:25 - Martin Muñoz, Cristian Riveros:
Constant-Delay Enumeration for SLP-Compressed Documents. 7:1-7:17 - Kyle Deeds, Dan Suciu, Magda Balazinska, Walter Cai:
Degree Sequence Bound for Join Cardinality Estimation. 8:1-8:18 - Andreas Pieris, Jorge Salas:
Absolute Expressiveness of Subgraph-Based Centrality Measures. 9:1-9:18 - Timo Camillo Merkl, Reinhard Pichler, Sebastian Skritek:
Diversity of Answers to Conjunctive Queries. 10:1-10:19 - Majd Khalil, Benny Kimelfeld:
The Complexity of the Shapley Value for Regular Path Queries. 11:1-11:19 - Cristian Riveros, Jorge Salas, Oskar Skibski:
How Do Centrality Measures Choose the Root of Trees? 12:1-12:17 - Tamara Cucumides, Juan L. Reutter, Domagoj Vrgoc:
Size Bounds and Algorithms for Conjunctive Regular Path Queries. 13:1-13:17 - Antoine Amarilli:
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. 14:1-14:17 - Diego Figueira, Rémi Morvan:
Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries. 15:1-15:19 - Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Work-Efficient Query Evaluation with PRAMs. 16:1-16:20 - Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Conjunctive Queries with Free Access Patterns Under Updates. 17:1-17:20 - Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. 18:1-18:18 - Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah:
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. 19:1-19:19 - Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. 20:1-20:19 - Jingfan Meng, Huayi Wang, Jun Xu, Mitsunori Ogihara:
On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions. 21:1-21:18 - Amir Gilad, Aviram Imber, Benny Kimelfeld:
The Consistency of Probabilistic Databases with Independent Cells. 22:1-22:19 - Aziz Amezian El Khalfioui, Jef Wijsen:
Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting. 23:1-23:19 - Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering Under Primary Keys. 24:1-24:18
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-11-13 23:36 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:
