Spremljaj
Wim Martens
Wim Martens
University of Bayreuth
Preverjeni e-poštni naslov na uni-bayreuth.de - Domača stran
Naslov
Navedeno
Navedeno
Leto
Expressiveness and complexity of XML Schema
W Martens, F Neven, T Schwentick, GJ Bex
ACM Transactions on Database Systems (TODS) 31 (3), 770-813, 2006
2222006
The future is big graphs: a community view on graph processing systems
S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ...
Communications of the ACM 64 (9), 62-71, 2021
2202021
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm
PVLDB 11, 2017
1582017
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm
The VLDB Journal 29 (2), 655-679, 2020
1352020
Graph pattern matching in GQL and SQL/PGQ
A Deutsch, N Francis, A Green, K Hare, B Li, L Libkin, T Lindaaker, ...
Proceedings of the 2022 International Conference on Management of Data, 2246 …, 2022
1112022
Querying graphs with data
L Libkin, W Martens, D Vrgoč
Journal of the ACM (JACM) 63 (2), 14, 2016
1092016
Querying graph databases with XPath
L Libkin, W Martens, D Vrgoč
Proceedings of the 16th International Conference on Database Theory, 129-140, 2013
1062013
On the minimization of XML schemas and tree automata for unranked trees
W Martens, J Niehren
Journal of Computer and System Sciences 73 (4), 550-583, 2007
962007
Frontiers of tractability for typechecking simple XML transformations
W Martens, F Neven
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
952004
Navigating the maze of wikidata query logs
A Bonifati, W Martens, T Timm
The World Wide Web Conference, 127-138, 2019
882019
Typechecking top-down uniform unranked tree transducers
W Martens, F Neven
International Conference on Database Theory, 64-78, 2002
872002
The complexity of evaluating path expressions in SPARQL
K Losemann, W Martens
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
852012
Complexity of decision problems for simple regular expressions
W Martens, F Neven, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 889-900, 2004
782004
Research directions for Principles of Data Management (Dagstuhl perspectives workshop 16151)
S Abiteboul, M Arenas, P Barceló, M Bienvenu, D Calvanese, C David, ...
arXiv preprint arXiv:1701.09007, 2017
73*2017
Regular expressions with counting: Weak versus strong determinism
W Gelade, M Gyssens, W Martens
SIAM Journal on Computing 41 (1), 160-190, 2012
712012
Efficient separability of regular languages by subsequences and suffixes
W Czerwiński, W Martens, T Masopust
Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013
672013
Complexity of decision problems for XML schemas and chain regular expressions
W Martens, F Neven, T Schwentick
SIAM Journal on Computing 39 (4), 1486-1530, 2009
662009
Pg-keys: Keys for property graphs
R Angles, A Bonifati, S Dumbrava, G Fletcher, KW Hare, J Hidders, ...
Proceedings of the 2021 International Conference on Management of Data, 2423 …, 2021
652021
The complexity of regular expressions and property paths in SPARQL
K Losemann, W Martens
ACM Transactions on Database Systems (TODS) 38 (4), 24, 2013
652013
PG-Schema: Schemas for property graphs
R Angles, A Bonifati, S Dumbrava, G Fletcher, A Green, J Hidders, B Li, ...
Proceedings of the ACM on Management of Data 1 (2), 1-25, 2023
612023
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20