Wim Martens
Wim Martens
Informatik · Universität Bayreuth
|
|
|
Personal Information
Employment history
| 09/2011 - | Professor, Theoretical Computer Science, University of Bayreuth, Germany |
| 05/2009 - 08/2011 | Juniorprofessor, Database Theory, TU Dortmund, Germany |
| 09/2006 - 04/2009 | Postdoc, TU Dortmund, Germany |
| 09/2001 - 08/2006 | Teaching Assistant, Hasselt University, Belgium |
COMPETENCES
Wim Martens represents Principles of Data Management and Formal Languages. This includes foundational aspects of query languages, schema languages, data models (relational, tree-structured, graph-structured, grid-structured), logics, and complexity. Typical problems we consider are complexity of query evaluation and -optimization, and expressiveness of query languages. Furthermore, his research has a focus on standards for data on the World Wide Web (XML, JSON, RDF, etc.).
Publications related to MODUS
2019
-
2019 A Unified Framework for Frequent Sequence Mining with Subsequence Constraints ACM Transactions on Database Systems 44 3 BibTeX
-
2019 Split-Correctness in Information Extraction Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 149-163 BibTeX
-
2019 Navigating the Maze of Wikidata Query Logs The World Wide Web Conference : Proceedings 127-138 BibTeX
Artikel
Buchkapitel
2018
-
2018 Conjunctive query containment over trees using schema information Acta Informatica 55 1 17-56 BibTeX
-
2018 Satisfiability for SCULPT-Schemas for CSV-Like Data 21st International Conference on Database Theory, March 26-29, 2018 - Vienna, Austria : Proceedings BibTeX
-
2018 DARQL : Deep Analysis of SPARQL Queries Companion of the The Web Conference 2018 on The Web Conference 2018, WWW 2018, Lyon , France, April 23-27, 2018 187-190 BibTeX
-
2018 MSO Queries on Trees : Enumerating Answers under Updates Using Forest Algebras Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science 769-778 BibTeX
-
2018 Chisel : Sculpting Tabular and Non-Tabular Data on the Web Companion of the The Web Conference 2018 on The Web Conference 2018, WWW 2018, Lyon , France, April 23-27, 2018 139-142 BibTeX
-
2018 Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates SIGMOND-PODS '18 : Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018 179-191 BibTeX
-
2018 Evaluation and Enumeration Problems for Regular Path Queries 21st International Conference on Database Theory (ICDT 2018) : Proceedings BibTeX
Artikel
Buchkapitel
2017
-
2017 Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data SIGMOD Record 46 1 15-22 BibTeX
-
2017 Deciding definability by deterministic regular expressions Journal of Computer and System Sciences 88 75-89 BibTeX
-
2017 BonXai : Combining the Simplicity of DTD with the Expressiveness of XML Schema ACM Transactions on Database Systems 42 3 BibTeX
-
2017 An Analytical Study of Large SPARQL Query Logs Proceedings of the VLDB Endowment 11 2 149-161 BibTeX
-
2017 Optimizing tree pattern queries : why cutting is not enough (invited talk) STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing 3 BibTeX
Artikel
Buchkapitel
2016
-
2016 Closure properties and descriptional complexity of deterministic regular expressions Theoretical Computer Science 627 54-70 BibTeX
-
2016 Minimization of Tree Pattern Queries Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016 43-54 BibTeX
Artikel
Buchkapitel
2015
-
2015 Separability by Short Subsequences and Subwords 18th International Conference on Database Theory 230-246 BibTeX
-
2015 The (Almost) Complete Guide to Tree Pattern Containment PODS '15 : Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015 117-130 BibTeX
-
2015 SCULPT: A Schema Language for Tabular Data on the Web Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015 702-720 BibTeX
-
2015 BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 145-156 BibTeX
-
2015 Efficient Incremental Evaluation of Succinct Regular Expressions Proceedings of the 24th ACM International Conference on Information and Knowledge Management 1541-1550 BibTeX
Buchkapitel
2013
-
2013 The complexity of regular expressions and property paths in SPARQL ACM Transactions on Database Systems 38 4 BibTeX
-
2013 Generating, Sampling and Counting Subclasses of Regular Tree Languages Theory of Computing Systems 52 3 542-585 BibTeX
-
2013 Querying graph databases with XPath Proceedings of the 16th International Conference on Database Theory 129-140 BibTeX
-
2013 Containment of pattern-based queries over data trees Proceedings of the 16th International Conference on Database Theory 201-212 BibTeX
-
2013 Efficient Separability of Regular Languages by Subsequences and Suffixes 40th International Colloquium on Automata, Languages, and Programming 150-161 BibTeX
Artikel
Buchkapitel
2012
-
2012 The tractability frontier for NFA minimization Journal of Computer and System Sciences 78 1 198-210 BibTeX
-
2012 Regular Expressions with Counting : Weak versus Strong Determinism SIAM Journal on Computing 41 1 160-190 BibTeX
-
2012 Developing and Analyzing XSDs through BonXai Proceedings of the VLDB Endowment 5 12 1994-1997 BibTeX
-
2012 The complexity of evaluating path expressions in SPARQL Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems 101-112 BibTeX
Artikel
Buchkapitel
2011
-
2011 The complexity of text-preserving XML transformations Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems 247-258 BibTeX