29 listopada 2022 11:11
Wykład "Data Path Queries over Embedded Graph Databases" Anthony W. Lina - wtorek, 6 grudnia, 12:15
W dniach od 5 do 9 grudnia naszym gościem w Instytucie Informatyki będzie Anthony W. Lin z Uniwersytetu w Kaiserslautern. Wizyta odbędzie się w ramach programu przyjazdów profesorów wizytujących (IDUB).
We wtorek 6 grudnia o godzinie 12:15 w sali 25 wygłosi wykład pt. Data Path Queries over Embedded Graph Databases. Serdecznie zapraszamy.
Streszczenie:
We initiate the study of data-path query languages (in particular, regular data path queries (RDPQ) and conjunctive RDPQ (CRDPQ)) in the classic setting of embedded finite model theory, wherein each graph is "embedded" into a background infinite structure (with a decidable FO theory or fragments thereof). Our goal is to address the current lack of support for typed attribute data (e.g. integer arithmetics) in existing data-path query languages, which are crucial in practice. We propose an extension of register automata by allowing powerful constraints over the theory and the database as guards, and having two types of registers: registers that can store values from the active domain, and read-only registers that can store arbitrary values. We prove NL data complexity for (C)RDPQ over the Presburger arithmetic, the real-closed field, the existential theory of automatic structures and word equations with regular constraints. All these results strictly extend the known NL data complexity of RDPQ with only equality comparisons, and provides an
answer to a recent open problem posed by Libkin et al. Among others, we introduce one crucial proof technique for obtaining NL data complexity for data path queries over embedded graph databases called "Restricted Register Collapse (RRC)", inspired by the notion of Restricted Quantifier Collapse (RQC) in embedded finite model theory.