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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
Tamara Cucumides, Juan Reutter, and Domagoj Vrgoč. Size Bounds and Algorithms for Conjunctive Regular Path Queries. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{cucumides_et_al:LIPIcs.ICDT.2023.13, author = {Cucumides, Tamara and Reutter, Juan and Vrgo\v{c}, Domagoj}, title = {{Size Bounds and Algorithms for Conjunctive Regular Path Queries}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {13:1--13: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.13}, URN = {urn:nbn:de:0030-drops-177552}, doi = {10.4230/LIPIcs.ICDT.2023.13}, annote = {Keywords: graph databases, regular path queries, worst-case optimal algorithms} }
Antoine Amarilli. Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{amarilli:LIPIcs.ICDT.2023.14, author = {Amarilli, Antoine}, title = {{Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {14:1--14: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.14}, URN = {urn:nbn:de:0030-drops-177566}, doi = {10.4230/LIPIcs.ICDT.2023.14}, annote = {Keywords: Uniform reliability, #P-hardness, probabilistic databases} }
Diego Figueira and Rémi Morvan. Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{figueira_et_al:LIPIcs.ICDT.2023.15, author = {Figueira, Diego and Morvan, R\'{e}mi}, title = {{Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {15:1--15: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.15}, URN = {urn:nbn:de:0030-drops-177575}, doi = {10.4230/LIPIcs.ICDT.2023.15}, annote = {Keywords: graph databases, conjunctive regular path queries, semantic optimization, tree-width, containment, approximation} }
Jens Keppeler, Thomas Schwentick, and Christopher Spinrath. Work-Efficient Query Evaluation with PRAMs. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 16:1-16:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{keppeler_et_al:LIPIcs.ICDT.2023.16, author = {Keppeler, Jens and Schwentick, Thomas and Spinrath, Christopher}, title = {{Work-Efficient Query Evaluation with PRAMs}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {16:1--16: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.16}, URN = {urn:nbn:de:0030-drops-177589}, doi = {10.4230/LIPIcs.ICDT.2023.16}, annote = {Keywords: PRAM, query evaluation, work-efficient, parallel, acyclic queries, free-connex queries} }
Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. Conjunctive Queries with Free Access Patterns Under Updates. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kara_et_al:LIPIcs.ICDT.2023.17, author = {Kara, Ahmet and Nikolic, Milos and Olteanu, Dan and Zhang, Haozhe}, title = {{Conjunctive Queries with Free Access Patterns Under Updates}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {17:1--17: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.17}, URN = {urn:nbn:de:0030-drops-177599}, doi = {10.4230/LIPIcs.ICDT.2023.17}, annote = {Keywords: fully dynamic algorithm, enumeration delay, complexity trade-off, dichotomy} }
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, and Sebastian Rudolph. Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{feller_et_al:LIPIcs.ICDT.2023.18, author = {Feller, Thomas and Lyon, Tim S. and Ostropolski-Nalewaja, Piotr and Rudolph, Sebastian}, title = {{Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {18:1--18: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.18}, URN = {urn:nbn:de:0030-drops-177602}, doi = {10.4230/LIPIcs.ICDT.2023.18}, annote = {Keywords: existential rules, TGDs, cliquewidth, treewidth, bounded-treewidth sets, finite-unification sets, first-order rewritability, monadic second-order logic, datalog} }
Sepehr Assadi, Nirmit Joshi, Milind Prabhu, and Vihan Shah. Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 19:1-19:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{assadi_et_al:LIPIcs.ICDT.2023.19, author = {Assadi, Sepehr and Joshi, Nirmit and Prabhu, Milind and Shah, Vihan}, title = {{Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {19:1--19: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.19}, URN = {urn:nbn:de:0030-drops-177618}, doi = {10.4230/LIPIcs.ICDT.2023.19}, annote = {Keywords: Streaming algorithms, Quantile summaries, Rank estimation} }
Martin Grohe, Peter Lindner, and Christoph Standke. Probabilistic Query Evaluation with Bag Semantics. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{grohe_et_al:LIPIcs.ICDT.2023.20, author = {Grohe, Martin and Lindner, Peter and Standke, Christoph}, title = {{Probabilistic Query Evaluation with Bag Semantics}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {20:1--20: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.20}, URN = {urn:nbn:de:0030-drops-177636}, doi = {10.4230/LIPIcs.ICDT.2023.20}, annote = {Keywords: Probabilistic Query Evaluation, Probabilistic Databases, Bag Semantics} }
Jingfan Meng, Huayi Wang, Jun Xu, and Mitsunori Ogihara. On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{meng_et_al:LIPIcs.ICDT.2023.21, author = {Meng, Jingfan and Wang, Huayi and Xu, Jun and Ogihara, Mitsunori}, title = {{On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {21:1--21: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.21}, URN = {urn:nbn:de:0030-drops-177624}, doi = {10.4230/LIPIcs.ICDT.2023.21}, annote = {Keywords: fast range-summation, multidimensional data streams, Haar wavelet transform} }
Amir Gilad, Aviram Imber, and Benny Kimelfeld. The Consistency of Probabilistic Databases with Independent Cells. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{gilad_et_al:LIPIcs.ICDT.2023.22, author = {Gilad, Amir and Imber, Aviram and Kimelfeld, Benny}, title = {{The Consistency of Probabilistic Databases with Independent Cells}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {22:1--22: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.22}, URN = {urn:nbn:de:0030-drops-177644}, doi = {10.4230/LIPIcs.ICDT.2023.22}, annote = {Keywords: Probabilistic databases, attribute-level uncertainty, functional dependencies, most probable database} }
Aziz Amezian El Khalfioui and Jef Wijsen. Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{amezianelkhalfioui_et_al:LIPIcs.ICDT.2023.23, author = {Amezian El Khalfioui, Aziz and Wijsen, Jef}, title = {{Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {23:1--23: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.23}, URN = {urn:nbn:de:0030-drops-177659}, doi = {10.4230/LIPIcs.ICDT.2023.23}, annote = {Keywords: Consistent query answering, primary key, conjunctive query, aggregation, counting} }
Diego Figueira, Anantha Padmanabha, Luc Segoufin, and Cristina Sirangelo. A Simple Algorithm for Consistent Query Answering Under Primary Keys. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{figueira_et_al:LIPIcs.ICDT.2023.24, author = {Figueira, Diego and Padmanabha, Anantha and Segoufin, Luc and Sirangelo, Cristina}, title = {{A Simple Algorithm for Consistent Query Answering Under Primary Keys}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {24:1--24: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.24}, URN = {urn:nbn:de:0030-drops-177663}, doi = {10.4230/LIPIcs.ICDT.2023.24}, annote = {Keywords: consistent query answering, primary keys, conjunctive queries} }
Feedback for Dagstuhl Publishing