Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Matthias Niewerth"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for paths in G for which the sequence of labels is in the language of r. In o
Externí odkaz:
https://doaj.org/article/a83e06725f2b41638bb87f556f8cdedc
Modern graph database query languages such as GQL, SQL/PGQ, and their academic predecessor G-Core promote paths to first-class citizens in the sense that their pattern matching facility can return paths, as opposed to only nodes and edges. This is ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f44bded9ae02183be7f8ac0e9a4371ab
http://hdl.handle.net/1942/40357
http://hdl.handle.net/1942/40357
Publikováno v:
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dce4df355198fe320668d67a861039d
https://doi.org/10.1145/3517804.3524150
https://doi.org/10.1145/3517804.3524150
Autor:
Shankara Narayanan Krishna, Matthias Niewerth, Adwait Godbole, Tina Trautner, Diego Figueira, Wim Martens
Publikováno v:
KR
Testing containment of queries is a fundamental reasoning task in knowledge representation. We study here the containment problem for Conjunctive Regular Path Queries (CRPQs), a navigational query language extensively used in ontology and graph datab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a44a3b2e490a70f4c827347a725680ca
https://doi.org/10.24963/kr.2020/38
https://doi.org/10.24963/kr.2020/38
Publikováno v:
Journal of the ACM. 65:1-46
Many of today’s graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were ori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::714885279a98f064f9236a5e9108813a
https://doi.org/10.1145/3180281
https://doi.org/10.1145/3180281
Autor:
Matthias Niewerth, Thomas Schwentick
Publikováno v:
Theory of Computing Systems. 62:1826-1879
The article introduces a simple framework for the specification of constraints for XML documents in which constraints are specified by (1) a mapping that extracts a relation from every XML document and (2) a relational constraint on the resulting rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0e79c01c69f61faec5c782fd473c71d
https://doi.org/10.1007/s00224-018-9846-5
https://doi.org/10.1007/s00224-018-9846-5
Publikováno v:
PODS
While the migration from DTD to XML Schema was driven by a need for increased expressivity and flexibility, the latter was also significantly more complex to use and understand. Whereas DTDs are characterized by their simplicity, XML Schema Documents
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b14425941fa10689580cf61cda82040f
https://doi.org/10.1145/3105960
https://doi.org/10.1145/3105960
Publikováno v:
ACM SIGMOD Record. 46:15-22
Many of today's graph query languages are based on graph pattern matching. We investigate optimization for treeshaped patterns with transitive closure. Such patterns are quite expressive, yet can be evaluated efficiently. The minimization problem aim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a830bd8fe33c0d2346af3c57e093e040
https://doi.org/10.1145/3093754.3093759
https://doi.org/10.1145/3093754.3093759
Publikováno v:
PODS
PODS, Jun 2019, Amsterdam, France. pp.89-103, ⟨10.1145/3294052.3319702⟩
PODS, Jun 2019, Amsterdam, France. pp.89-103, ⟨10.1145/3294052.3319702⟩
We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the input tree), we can enumerate answers with linear delay (in each answe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79708e19932343de7e14215a2eb375f6
https://hal.archives-ouvertes.fr/hal-02326243
https://hal.archives-ouvertes.fr/hal-02326243
Autor:
Matthias Niewerth, Luc Segoufin
Publikováno v:
Principles of Databse Systems, PODS'18
Principles of Databse Systems, PODS'18, Jun 2018, Houston, United States. ⟨10.1145/3196959.3196961⟩
PODS
Principles of Databse Systems, PODS'18, Jun 2018, Houston, United States. ⟨10.1145/3196959.3196961⟩
PODS
International audience; We consider the enumeration of MSO queries over strings under updates. For each MSO query we build an index structure enjoying the following properties: The index structure can be constructed in linear time, it can be updated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6df8f8bb178d146afab98d972ac1e51b
https://hal.inria.fr/hal-01895796
https://hal.inria.fr/hal-01895796