From post

Conjunctive Queries with Free Access Patterns Under Updates.

, , , и . ICDT, том 255 из LIPIcs, стр. 17:1-17:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Learning Models over Relational Databases (Invited Talk).. ICDT, том 127 из LIPIcs, стр. 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries., , , и . PODS, стр. 375-392. ACM, (2020)F-IVM: Learning over Fast-Evolving Relational Data., , , и . SIGMOD Conference, стр. 2773-2776. ACM, (2020)Conjunctive Queries with Free Access Patterns Under Updates., , , и . ICDT, том 255 из LIPIcs, стр. 17:1-17:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Evaluation Trade-Offs for Acyclic Conjunctive Queries., , , и . CSL, том 252 из LIPIcs, стр. 29:1-29:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Counting Triangles under Updates in Worst-Case Optimal Time., , , , и . ICDT, том 127 из LIPIcs, стр. 4:1-4:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Πgora: An Integration System for Probabilistic Data., , и . ICDE, стр. 1324-1327. IEEE Computer Society, (2013)From Shapley Value to Model Counting and Back., , и . Proc. ACM Manag. Data, 2 (2): 79 (2024)XPath : Looking Forward XPath : Looking Forward, , и . Tehnical Report, Computer Science Institute, Munich, (2001)Repeatability and workability evaluation of SIGMOD 2011, , , , , , , , , и 10 other автор(ы). SIGMOD Record, 40 (2): 45--48 (2011)