LIPIcs, Volume 255
ICDT 2023, March 28-31, 2023, Ioannina, Greece
Editors: Floris Geerts and Brecht Vandevoort
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 1-466, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Proceedings{geerts_et_al:LIPIcs.ICDT.2023, title = {{LIPIcs, Volume 255, ICDT 2023, Complete Volume}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {1--466}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023}, URN = {urn:nbn:de:0030-drops-177414}, doi = {10.4230/LIPIcs.ICDT.2023}, annote = {Keywords: LIPIcs, Volume 255, ICDT 2023, Complete Volume} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{geerts_et_al:LIPIcs.ICDT.2023.0, author = {Geerts, Floris and Vandevoort, Brecht}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.0}, URN = {urn:nbn:de:0030-drops-177424}, doi = {10.4230/LIPIcs.ICDT.2023.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, and Domagoj Vrgoč. A Researcher’s Digest of GQL (Invited Talk). In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 1:1-1:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{francis_et_al:LIPIcs.ICDT.2023.1, author = {Francis, Nadime and Gheerbrant, Am\'{e}lie and Guagliardo, Paolo and Libkin, Leonid and Marsault, Victor and Martens, Wim and Murlak, Filip and Peterfreund, Liat and Rogova, Alexandra and Vrgo\v{c}, Domagoj}, title = {{A Researcher’s Digest of GQL}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {1:1--1:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.1}, URN = {urn:nbn:de:0030-drops-177434}, doi = {10.4230/LIPIcs.ICDT.2023.1}, annote = {Keywords: GQL, Property Graph, Query Language, Graph Database, Pattern matching, Multi-Graph} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Gonzalo Navarro. Compact Data Structures Meet Databases (Invited Talk). In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{navarro:LIPIcs.ICDT.2023.2, author = {Navarro, Gonzalo}, title = {{Compact Data Structures Meet Databases}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {2:1--2:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.2}, URN = {urn:nbn:de:0030-drops-177446}, doi = {10.4230/LIPIcs.ICDT.2023.2}, annote = {Keywords: succinct data structures, tries, multidimensional grids, text searching} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
C. Seshadhri. Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 3:1-3:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{seshadhri:LIPIcs.ICDT.2023.3, author = {Seshadhri, C.}, title = {{Some Vignettes on Subgraph Counting Using Graph Orientations}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {3:1--3:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.3}, URN = {urn:nbn:de:0030-drops-177454}, doi = {10.4230/LIPIcs.ICDT.2023.3}, annote = {Keywords: subgraph counting, graph degeneracy, homomorphism counting, graph algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Shiyuan Deng, Francesco Silvestri, and Yufei Tao. Enumerating Subgraphs of Constant Sizes in External Memory. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 4:1-4:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{deng_et_al:LIPIcs.ICDT.2023.4, author = {Deng, Shiyuan and Silvestri, Francesco and Tao, Yufei}, title = {{Enumerating Subgraphs of Constant Sizes in External Memory}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {4:1--4:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.4}, URN = {urn:nbn:de:0030-drops-177460}, doi = {10.4230/LIPIcs.ICDT.2023.4}, annote = {Keywords: Subgraph Enumeration, Conjunctive Queries, External Memory, Algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Pavel Raykov. An Optimal Algorithm for Sliding Window Order Statistics. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{raykov:LIPIcs.ICDT.2023.5, author = {Raykov, Pavel}, title = {{An Optimal Algorithm for Sliding Window Order Statistics}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.5}, URN = {urn:nbn:de:0030-drops-177479}, doi = {10.4230/LIPIcs.ICDT.2023.5}, annote = {Keywords: sliding window, order statistics, median, selection algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Shiyuan Deng, Shangqi Lu, and Yufei Tao. Space-Query Tradeoffs in Range Subgraph Counting and Listing. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 6:1-6:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{deng_et_al:LIPIcs.ICDT.2023.6, author = {Deng, Shiyuan and Lu, Shangqi and Tao, Yufei}, title = {{Space-Query Tradeoffs in Range Subgraph Counting and Listing}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {6:1--6:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.6}, URN = {urn:nbn:de:0030-drops-177484}, doi = {10.4230/LIPIcs.ICDT.2023.6}, annote = {Keywords: Subgraph Pattern Counting, Subgraph Pattern Listing, Conjunctive Queries} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Martín Muñoz and Cristian Riveros. Constant-Delay Enumeration for SLP-Compressed Documents. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{munoz_et_al:LIPIcs.ICDT.2023.7, author = {Mu\~{n}oz, Mart{\'\i}n and Riveros, Cristian}, title = {{Constant-Delay Enumeration for SLP-Compressed Documents}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.7}, URN = {urn:nbn:de:0030-drops-177495}, doi = {10.4230/LIPIcs.ICDT.2023.7}, annote = {Keywords: SLP compression, query evaluation, enumeration algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Kyle Deeds, Dan Suciu, Magda Balazinska, and Walter Cai. Degree Sequence Bound for Join Cardinality Estimation. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{deeds_et_al:LIPIcs.ICDT.2023.8, author = {Deeds, Kyle and Suciu, Dan and Balazinska, Magda and Cai, Walter}, title = {{Degree Sequence Bound for Join Cardinality Estimation}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.8}, URN = {urn:nbn:de:0030-drops-177508}, doi = {10.4230/LIPIcs.ICDT.2023.8}, annote = {Keywords: Cardinality Estimation, Cardinality Bounding, Degree Bounds, Functional Approximation, Query Planning, Berge-Acyclic Queries} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Andreas Pieris and Jorge Salas. Absolute Expressiveness of Subgraph-Based Centrality Measures. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{pieris_et_al:LIPIcs.ICDT.2023.9, author = {Pieris, Andreas and Salas, Jorge}, title = {{Absolute Expressiveness of Subgraph-Based Centrality Measures}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.9}, URN = {urn:nbn:de:0030-drops-177516}, doi = {10.4230/LIPIcs.ICDT.2023.9}, annote = {Keywords: Graph centrality measures, ranking, expressiveness} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Timo Camillo Merkl, Reinhard Pichler, and Sebastian Skritek. Diversity of Answers to Conjunctive Queries. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{merkl_et_al:LIPIcs.ICDT.2023.10, author = {Merkl, Timo Camillo and Pichler, Reinhard and Skritek, Sebastian}, title = {{Diversity of Answers to Conjunctive Queries}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {10:1--10:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.10}, URN = {urn:nbn:de:0030-drops-177529}, doi = {10.4230/LIPIcs.ICDT.2023.10}, annote = {Keywords: Query Answering, Diversity of Solutions, Complexity, Algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Majd Khalil and Benny Kimelfeld. The Complexity of the Shapley Value for Regular Path Queries. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{khalil_et_al:LIPIcs.ICDT.2023.11, author = {Khalil, Majd and Kimelfeld, Benny}, title = {{The Complexity of the Shapley Value for Regular Path Queries}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.11}, URN = {urn:nbn:de:0030-drops-177535}, doi = {10.4230/LIPIcs.ICDT.2023.11}, annote = {Keywords: Path queries, regular path queries, graph databases, Shapley value} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Cristian Riveros, Jorge Salas, and Oskar Skibski. How Do Centrality Measures Choose the Root of Trees?. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{riveros_et_al:LIPIcs.ICDT.2023.12, author = {Riveros, Cristian and Salas, Jorge and Skibski, Oskar}, title = {{How Do Centrality Measures Choose the Root of Trees?}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.12}, URN = {urn:nbn:de:0030-drops-177545}, doi = {10.4230/LIPIcs.ICDT.2023.12}, annote = {Keywords: Databases, centrality measures, data centrality, graph theory, tree structures} }
Feedback for Dagstuhl Publishing