Wim Martens

According to our database, Wim Martens authored at least 109 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Partial Order Multiway Search.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

ACM Trans. Database Syst., December, 2023

An Optimal Algorithm for Partial Order Multiway Search.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

SIGMOD Rec., 2023

Threshold Queries.

Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk

SIGMOD Rec., 2023

Representing Paths in Graph Database Pattern Matching.

Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc

Proc. VLDB Endow., 2023

PG-Schema: Schemas for Property Graphs.

Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savkovic, Michael Schmidt, Juan Sequeda, Slawek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Dusan Zivkovic

Proc. ACM Manag. Data, 2023

A Trichotomy for Regular Trail Queries.

Wim Martens, Matthias Niewerth, Tina Popp

Log. Methods Comput. Sci., 2023

The Complexity of Aggregates over Extractions by Regular Expressions.

Johannes Doleschal, Benny Kimelfeld, Wim Martens

Log. Methods Comput. Sci., 2023

A Unifying Perspective on Succinct Data Representations.

Benny Kimelfeld, Wim Martens, Matthias Niewerth

CoRR, 2023

GPC: A Pattern Calculus for Property Graphs.

Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

A Researcher's Digest of GQL (Invited Talk).

Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc

Proceedings of the 26th International Conference on Database Theory, 2023

2022

Threshold Queries in Theory and in the Wild.

Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk

Proc. VLDB Endow., 2022

Weight Annotation in Information Extraction.

Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund

Log. Methods Comput. Sci., 2022

Representing Paths in Graph Database Pattern Matching.

Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc

CoRR, 2022

Graph Pattern Matching in GQL and SQL/PGQ.

Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Fred Zemke

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs.

Wim Martens, Tina Popp

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Towards Theory for Real-World Data.

Wim Martens

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Optimal Algorithms for Multiway Search on Partial Orders.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021

Database Principles and Challenges in Text Analysis.

Johannes Doleschal, Benny Kimelfeld, Wim Martens

SIGMOD Rec., 2021

The future is big graphs: a community view on graph processing systems.

Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki

Commun. ACM, 2021

PG-Keys: Keys for Property Graphs.

Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Keith W. Hare, Jan Hidders, Victor E. Lee, Bei Li, Leonid Libkin, Wim Martens, Filip Murlak, Josh Perryman, Ognjen Savkovic, Michael Schmidt, Juan F. Sequeda, Slawek Staworko, Dominik Tomaszuk

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

The Complexity of Aggregates over Extractions by Regular Expressions.

Johannes Doleschal, Noa Bratman, Benny Kimelfeld, Wim Martens

Proceedings of the 24th International Conference on Database Theory, 2021

Learning algorithms.

Henrik Björklund, Johanna Björklund, Wim Martens

Proceedings of the Handbook of Automata Theory., 2021

2020

Holding a Conference Online and Live due to Covid-19: Experiences and Lessons Learned from EDBT / ICDT 2020.

Angela Bonifati, Giovanna Guerrini, Carsten Lutz, Wim Martens, Lara Mazilu, Norman W. Paton, Marcos Antonio Vaz Salles, Marc H. Scholl, Yongluan Zhou

SIGMOD Rec., 2020

Holding a Conference Online and Live due to COVID-19.

Angela Bonifati, Giovanna Guerrini, Carsten Lutz, Wim Martens, Lara Mazilu, Norman W. Paton, Marcos Antonio Vaz Salles, Marc H. Scholl, Yongluan Zhou

CoRR, 2020

Containment of Simple Regular Path Queries.

Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner

CoRR, 2020

SHARQL: Shape Analysis of Recursive SPARQL Queries.

Angela Bonifati, Wim Martens, Thomas Timm

Proceedings of the 2020 International Conference on Management of Data, 2020

Containment of Simple Conjunctive Regular Path Queries.

Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Formal Languages in Information Extraction and Graph Databases.

Wim Martens

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Dichotomies for Evaluating Simple Regular Path Queries.

Wim Martens, Tina Trautner

ACM Trans. Database Syst., 2019

A Unified Framework for Frequent Sequence Mining with Subsequence Constraints.

Kaustubh Beedkar, Rainer Gemulla, Wim Martens

ACM Trans. Database Syst., 2019

Bridging Theory and Practice with Query Log Analysis.

Wim Martens, Tina Trautner

SIGMOD Rec., 2019

Technical Perspective: Efficient Query Processing for Dynamically Changing Datasets.

Wim Martens

SIGMOD Rec., 2019

Technical Perspective: Entity Matching with Quality and Error Guarantees.

Benny Kimelfeld, Wim Martens

SIGMOD Rec., 2019

Annotated Document Spanners.

Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund

CoRR, 2019

Navigating the Maze of Wikidata Query Logs.

Angela Bonifati, Wim Martens, Thomas Timm

Proceedings of the World Wide Web Conference, 2019

Split-Correctness in Information Extraction.

Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Towards Intuitive Robot Programming Using Finite State Automata.

Lukas Sauer, Dominik Henrich, Wim Martens

Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

2018

Foreword: Special Issue on Database Theory.

Wim Martens

Theory Comput. Syst., 2018

Minimization of Tree Patterns.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

J. ACM, 2018

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

Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi

Dagstuhl Manifestos, 2018

Conjunctive query containment over trees using schema information.

Henrik Björklund, Wim Martens, Thomas Schwentick

Acta Informatica, 2018

Chisel: Sculpting Tabular and Non-Tabular Data on the Web.

Johannes Doleschal, Nico Höllerich, Wim Martens, Frank Neven

Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

DARQL: Deep Analysis of SPARQL Queries.

Angela Bonifati, Wim Martens, Thomas Timm

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.

Maurizio Lenzerini, Wim Martens, Nicole Schweikardt

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Evaluation and Enumeration Problems for Regular Path Queries.

Wim Martens, Tina Trautner

Proceedings of the 21st International Conference on Database Theory, 2018

Satisfiability for SCULPT-Schemas for CSV-Like Data.

Johannes Doleschal, Wim Martens, Frank Neven, Adam Witkowski

Proceedings of the 21st International Conference on Database Theory, 2018

2017

BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.

Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick

ACM Trans. Database Syst., 2017

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

SIGMOD Rec., 2017

An Analytical Study of Large SPARQL Query Logs.

Angela Bonifati, Wim Martens, Thomas Timm

Proc. VLDB Endow., 2017

Deciding definability by deterministic regular expressions.

Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens

J. Comput. Syst. Sci., 2017

A Characterization for Decidable Separability by Piecewise Testable Languages.

Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche

Discret. Math. Theor. Comput. Sci., 2017

Enumeration Problems for Regular Path Queries.

Wim Martens, Tina Trautner

CoRR, 2017

Optimizing tree pattern queries: why cutting is not enough (invited talk).

Wim Martens

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Closure properties and descriptional complexity of deterministic regular expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Theor. Comput. Sci., 2016

Research Directions for Principles of Data Management (Abridged).

Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi

SIGMOD Rec., 2016

Querying Graphs with Data.

Leonid Libkin, Wim Martens, Domagoj Vrgoc

J. ACM, 2016

Foundations of Data Management (Dagstuhl Perspectives Workshop 16151).

Marcelo Arenas, Richard Hull, Wim Martens, Tova Milo, Thomas Schwentick

Dagstuhl Reports, 2016

Minimization of Tree Pattern Queries.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

Deciding Twig-definability of Node Selecting Tree Automata.

Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven

Theory Comput. Syst., 2015

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

Wim Martens, Frank Neven, Stijn Vansummeren

Proceedings of the 24th International Conference on World Wide Web, 2015

The (Almost) Complete Guide to Tree Pattern Containment.

Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Separability by Short Subsequences and Subwords.

Piotr Hofman, Wim Martens

Proceedings of the 18th International Conference on Database Theory, 2015

A Note on Decidable Separability by Piecewise Testable Languages.

Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Efficient Incremental Evaluation of Succinct Regular Expressions.

Henrik Björklund, Wim Martens, Thomas Timm

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Theory for processing data on the Web.

Wim Martens

it Inf. Technol., 2014

A Note on Decidable Separability by Piecewise Testable Languages.

Wojciech Czerwinski, Wim Martens

CoRR, 2014

The ICDT 2014 Test of Time Award.

Michael Benedikt, Ronald Fagin, Wim Martens

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

MSO queries on trees: enumerating answers under updates.

Katja Losemann, Wim Martens

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.

Katja Losemann, Wim Martens

ACM Trans. Database Syst., 2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.

Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven

Theory Comput. Syst., 2013

Simplifying XML Schema: Single-type approximations of regular tree languages.

Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven, Jan Paredaens

J. Comput. Syst. Sci., 2013

Counting in SPARQL Property Paths: Perspectives from Theory and Practice.

Wim Martens

Proceedings of the Logic, Language, Information, and Computation, 2013

Validity of Tree Pattern Queries with Respect to Schema Information.

Henrik Björklund, Wim Martens, Thomas Schwentick

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Querying graph databases with XPath.

Leonid Libkin, Wim Martens, Domagoj Vrgoc

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Containment of pattern-based queries over data trees.

Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Efficient Separability of Regular Languages by Subsequences and Suffixes.

Wojciech Czerwinski, Wim Martens, Tomás Masopust

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Regular Expressions with Counting: Weak versus Strong Determinism.

Wouter Gelade, Marc Gyssens, Wim Martens

SIAM J. Comput., 2012

Developing and Analyzing XSDs through BonXai.

Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick

Proc. VLDB Endow., 2012

The tractability frontier for NFA minimization.

Henrik Björklund, Wim Martens

J. Comput. Syst. Sci., 2012

The complexity of evaluating path expressions in SPARQL.

Katja Losemann, Wim Martens

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Descriptional Complexity of Deterministic Regular Expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

30 Years of PODS in facts and figures.

Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees

SIGMOD Rec., 2011

Conjunctive query containment over trees.

Henrik Björklund, Wim Martens, Thomas Schwentick

J. Comput. Syst. Sci., 2011

The complexity of text-preserving XML transformations.

Timos Antonopoulos, Wim Martens, Frank Neven

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2010

Incremental XPath evaluation.

Henrik Björklund, Wouter Gelade, Wim Martens

ACM Trans. Database Syst., 2010

Logik und Automaten: ein echtes Dreamteam.

Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick

Inform. Spektrum, 2010

Schema design for XML repositories: complexity and tractability.

Wim Martens, Matthias Niewerth, Thomas Schwentick

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.

Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven

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.

Wim Martens, Frank Neven, Thomas Schwentick

SIAM J. Comput., 2009

Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.

Wouter Gelade, Wim Martens, Frank Neven

SIAM J. Comput., 2009

Efficient algorithms for descendant-only tree pattern queries.

Michaela Götz, Christoph Koch, Wim Martens

Inf. Syst., 2009

Simplifying XML schema: effortless handling of nondeterministic regular expressions.

Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Incremental XPath evaluation.

Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens

Proceedings of the Database Theory, 2009

2008

Typechecking top-down XML transformations: Fixed input or output schemas.

Wim Martens, Frank Neven, Marc Gyssens

Inf. Comput., 2008

Optimizing Conjunctive Queries over Trees Using Schema Information.

Henrik Björklund, Wim Martens, Thomas Schwentick

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Deterministic top-down tree automata: past, present, and future.

Wim Martens, Frank Neven, Thomas Schwentick

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Simple off the shelf abstractions for XML schema.

Wim Martens, Frank Neven, Thomas Schwentick

SIGMOD Rec., 2007

On the minimization of XML Schemas and tree automata for unranked trees.

Wim Martens, Joachim Niehren

J. Comput. Syst. Sci., 2007

Frontiers of tractability for typechecking simple XML transformations.

Wim Martens, Frank Neven

J. Comput. Syst. Sci., 2007

Efficient Algorithms for the Tree Homeomorphism Problem.

Michaela Götz, Christoph Koch, Wim Martens

Proceedings of the Database Programming Languages, 11th International Symposium, 2007

2006

Static analysis of XML transformation and schema languages

Wim Martens

PhD thesis, 2006

Expressiveness and complexity of XML Schema.

Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex

ACM Trans. Database Syst., 2006

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

Wim Martens, Frank Neven, Marc Gyssens

CoRR, 2006

2005

On the complexity of typechecking top-down XML transformations.

Wim Martens, Frank Neven

Theor. Comput. Sci., 2005

Expressiveness of XSDs: from practice to theory, there and back again.

Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick

Proceedings of the 14th international conference on World Wide Web, 2005

Which XML Schemas Admit 1-Pass Preorder Typing?

Wim Martens, Frank Neven, Thomas Schwentick

Proceedings of the Database Theory, 2005

Minimizing Tree Automata for Unranked Trees.

Wim Martens, Joachim Niehren

Proceedings of the Database Programming Languages, 10th International Symposium, 2005

2004

Complexity of Decision Problems for Simple Regular Expressions.

Wim Martens, Frank Neven, Thomas Schwentick

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Typechecking Top-Down Uniform Unranked Tree Transducers.

Wim Martens, Frank Neven

Proceedings of the Database Theory, 2003