Author of the publication

A Worst-Case Optimal Join Algorithm for SPARQL.

, , , and . ISWC (1), volume 11778 of Lecture Notes in Computer Science, page 258-275. Springer, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Bounded repairability for regular tree languages., , and . ICDT, page 155-168. ACM, (2012)How to choose the root: centrality measures over tree structures, , and . (2021)cite arxiv:2112.13736Comment: submitted to PODS2022.Streaming Enumeration on Nested Documents., and . ICDT, volume 220 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Enumeration for Annotated Grammars., , , and . PODS, page 291-300. ACM, (2022)When is approximate counting for conjunctive queries tractable?, , , and . STOC, page 1015-1027. ACM, (2021)A Family of Centrality Measures for Graph Data Based on Subgraphs., and . ICDT, volume 155 of LIPIcs, page 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Expressiveness of Languages for Complex Event Recognition., , , and . ICDT, volume 155 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The recovery of a schema mapping: bringing exchanged data back., , and . PODS, page 13-22. ACM, (2008)Expressive Power of Linear Algebra Query Languages., , , and . PODS, page 342-354. ACM, (2021)Matrix Query Languages., , , , and . SIGMOD Rec., 50 (3): 6-19 (2021)