Wim Martens

According to our database1, Wim Martens authored at least 83 papers between 2003 and 2018.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Foreword: Special Issue on Database Theory.
Theory Comput. Syst., 2018

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Manifestos, 2018

Conjunctive query containment over trees using schema information.
Acta Inf., 2018

Chisel: Sculpting Tabular and Non-Tabular Data on the Web.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

DARQL: Deep Analysis of SPARQL Queries.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Evaluation and Enumeration Problems for Regular Path Queries.
Proceedings of the 21st International Conference on Database Theory, 2018

Satisfiability for SCULPT-Schemas for CSV-Like Data.
Proceedings of the 21st International Conference on Database Theory, 2018

2017
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.
ACM Trans. Database Syst., 2017

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
SIGMOD Record, 2017

An Analytical Study of Large SPARQL Query Logs.
PVLDB, 2017

Deciding definability by deterministic regular expressions.
J. Comput. Syst. Sci., 2017

A Characterization for Decidable Separability by Piecewise Testable Languages.
Discrete Mathematics & Theoretical Computer Science, 2017

Enumeration Problems for Regular Path Queries.
CoRR, 2017

An Analytical Study of Large SPARQL Query Logs.
CoRR, 2017

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
CoRR, 2017

Optimizing tree pattern queries: why cutting is not enough (invited talk).
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Closure properties and descriptional complexity of deterministic regular expressions.
Theor. Comput. Sci., 2016

Research Directions for Principles of Data Management (Abridged).
SIGMOD Record, 2016

Querying Graphs with Data.
J. ACM, 2016

Foundations of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Reports, 2016

Minimization of Tree Pattern Queries.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Deciding Twig-definability of Node Selecting Tree Automata.
Theory Comput. Syst., 2015

SCULPT: A Schema Language for Tabular Data on the Web.
Proceedings of the 24th International Conference on World Wide Web, 2015

BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

The (Almost) Complete Guide to Tree Pattern Containment.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Separability by Short Subsequences and Subwords.
Proceedings of the 18th International Conference on Database Theory, 2015

A Note on Decidable Separability by Piecewise Testable Languages.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Efficient Incremental Evaluation of Succinct Regular Expressions.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Theory for processing data on the Web.
it - Information Technology, 2014

SCULPT: A Schema Language for Tabular Data on the Web.
CoRR, 2014

A Note on Decidable Separability by Piecewise Testable Languages.
CoRR, 2014

The ICDT 2014 Test of Time Award.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

MSO queries on trees: enumerating answers under updates.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
The complexity of regular expressions and property paths in SPARQL.
ACM Trans. Database Syst., 2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.
Theory Comput. Syst., 2013

Simplifying XML Schema: Single-type approximations of regular tree languages.
J. Comput. Syst. Sci., 2013

Efficient Separability of Regular Languages by Subsequences and Suffixes
CoRR, 2013

Counting in SPARQL Property Paths: Perspectives from Theory and Practice.
Proceedings of the Logic, Language, Information, and Computation, 2013

Validity of Tree Pattern Queries with Respect to Schema Information.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Querying graph databases with XPath.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Containment of pattern-based queries over data trees.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Efficient Separability of Regular Languages by Subsequences and Suffixes.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Deciding Definability by Deterministic Regular Expressions.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Regular Expressions with Counting: Weak versus Strong Determinism.
SIAM J. Comput., 2012

Developing and Analyzing XSDs through BonXai.
PVLDB, 2012

The tractability frontier for NFA minimization.
J. Comput. Syst. Sci., 2012

The complexity of evaluating path expressions in SPARQL.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Descriptional Complexity of Deterministic Regular Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Deciding twig-definability of node selecting tree automata.
Proceedings of the 15th International Conference on Database Theory, 2012

2011
30 Years of PODS in facts and figures.
SIGMOD Record, 2011

Conjunctive query containment over trees.
J. Comput. Syst. Sci., 2011

The complexity of text-preserving XML transformations.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Generating, sampling and counting subclasses of regular tree languages.
Proceedings of the Database Theory, 2011

2010
Incremental XPath evaluation.
ACM Trans. Database Syst., 2010

Logik und Automaten: ein echtes Dreamteam.
Informatik Spektrum, 2010

Schema design for XML repositories: complexity and tractability.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Simplifying XML schema: single-type approximations of regular tree languages.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions.
SIAM J. Comput., 2009

Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
SIAM J. Comput., 2009

Efficient algorithms for descendant-only tree pattern queries.
Inf. Syst., 2009

Simplifying XML schema: effortless handling of nondeterministic regular expressions.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Regular Expressions with Counting: Weak versus Strong Determinism.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Incremental XPath evaluation.
Proceedings of the Database Theory, 2009

2008
Typechecking top-down XML transformations: Fixed input or output schemas.
Inf. Comput., 2008

Optimizing Conjunctive Queries over Trees Using Schema Information.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Tractability Frontier for NFA Minimization.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Deterministic top-down tree automata: past, present, and future.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Simple off the shelf abstractions for XML schema.
SIGMOD Record, 2007

On the minimization of XML Schemas and tree automata for unranked trees.
J. Comput. Syst. Sci., 2007

Frontiers of tractability for typechecking simple XML transformations.
J. Comput. Syst. Sci., 2007

Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
Proceedings of the Database Theory, 2007

Efficient Algorithms for the Tree Homeomorphism Problem.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

Conjunctive Query Containment over Trees.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

2006
Expressiveness and complexity of XML Schema.
ACM Trans. Database Syst., 2006

On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
CoRR, 2006

2005
On the complexity of typechecking top-down XML transformations.
Theor. Comput. Sci., 2005

Expressiveness of XSDs: from practice to theory, there and back again.
Proceedings of the 14th international conference on World Wide Web, 2005

Which XML Schemas Admit 1-Pass Preorder Typing?
Proceedings of the Database Theory, 2005

Minimizing Tree Automata for Unranked Trees.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

2004
Frontiers of Tractability for Typechecking Simple XML Transformations.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Complexity of Decision Problems for Simple Regular Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Typechecking Top-Down Uniform Unranked Tree Transducers.
Proceedings of the Database Theory, 2003


  Loading...