Stijn Vansummeren

Orcid: 0000-0001-7793-9049

Affiliations:
  • Hasselt University, Belgium
  • Université libre de Bruxelles, Belgium (former)


According to our database1, Stijn Vansummeren authored at least 92 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow.
Proc. VLDB Endow., August, 2024

SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow.
CoRR, 2024

Schema Matching with Large Language Models: an Experimental Study.
Proceedings of Workshops at the 50th International Conference on Very Large Data Bases, 2024

Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility.
Proceedings of the 27th International Conference on Database Theory, 2024

Measuring Approximate Functional Dependencies: A Comparative Study.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Compact Path Representations for Graph Database Pattern Matching.
Proceedings of the 40th International Conference on Data Engineering, ICDE 2024, 2024

Annotation and More Annotation: Some Problems Posed by (and to) Val Tannen.
Proceedings of the Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, 2024

2023
Graph-Driven Federated Data Management.
IEEE Trans. Knowl. Data Eng., 2023

Technical Perspective: Conjunctive Queries with Comparisons.
SIGMOD Rec., 2023

Representing Paths in Graph Database Pattern Matching.
Proc. VLDB Endow., 2023

CM-Explorer: Dissecting Data Ingestion Problems.
Proc. VLDB Endow., 2023

Learning Graph Neural Networks using Exact Compression.
Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2023

Data Ingestion Validation through Stable Conditional Metrics with Ranking and Filtering.
Proceedings of the Advances in Databases and Information Systems, 2023

2022
CORE: a COmplex event Recognition Engine.
Proc. VLDB Endow., 2022

Representing Paths in Graph Database Pattern Matching.
CoRR, 2022

Getting to the CORE of Complex Event Recognition (Invited Talk).
Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

Graph-Driven Federated Data Management (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
A Formal Framework for Complex Event Recognition.
ACM Trans. Database Syst., 2021

2020
General dynamic Yannakakis: conjunctive queries with theta joins under updates.
VLDB J., 2020

Efficient Enumeration Algorithms for Regular Document Spanners.
ACM Trans. Database Syst., 2020

Dagstuhl Seminar on the Foundations of Composite Event Recognition.
SIGMOD Rec., 2020

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees.
Inf. Syst., 2020

Foundations of Composite Event Recognition (Dagstuhl Seminar 20071).
Dagstuhl Reports, 2020

On the Expressiveness of Languages for Complex Event Recognition.
Proceedings of the 23rd International Conference on Database Theory, 2020

2019
Efficient Query Processing for Dynamically Changing Datasets.
SIGMOD Rec., 2019

An integration-oriented ontology to govern evolution in Big Data ecosystems.
Inf. Syst., 2019

Conjunctive Queries with Theta Joins Under Updates.
CoRR, 2019

2018
XML Typechecking.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Conjunctive Queries with Inequalities Under Updates.
Proc. VLDB Endow., 2018

Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees.
CoRR, 2018

Constant Delay Algorithms for Regular Document Spanners.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

MDM: Governing Evolution in Big Data Ecosystems.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

Incremental Techniques for Large-Scale Dynamic Query Processing.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

On the Difference between Complex Event Processing and Dynamic Query Evaluation.
Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, 2018

2017
A software reference architecture for semantic-aware Big Data systems.
Inf. Softw. Technol., 2017

A Second-Order Approach to Complex Event Recognition.
CoRR, 2017

The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Complex Event Recognition Languages: Tutorial.
Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

2016
Declarative Cleaning of Inconsistencies in Information Extraction.
ACM Trans. Database Syst., 2016

Parallel Evaluation of Multi-Semi-Joins.
Proc. VLDB Endow., 2016

Incorporating information extraction in the relational database model.
Proceedings of the 19th International Workshop on Web and Databases, 2016

Empirical evaluation of guarded structural indexing.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015
A Relational Framework for Information Extraction.
SIGMOD Rec., 2015

Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations.
J. Log. Comput., 2015

Document Spanners: A Formal Approach to Information Extraction.
J. ACM, 2015

Relative expressive power of navigational querying on graphs.
Inf. Sci., 2015

Relative expressive power of navigational querying on graphs using transitive closure.
Log. J. IGPL, 2015

The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs.
Ann. Math. Artif. Intell., 2015

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

Relative expressive power of downward fragments of navigational query languages on trees and chains.
Proceedings of the 15th Symposium on Database Programming Languages, 2015

2014
Discovering XSD Keys from XML Data.
ACM Trans. Database Syst., 2014

Cleaning inconsistencies in information extraction via prioritized repairs.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

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

2013
Spanners: a formal framework for information extraction.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Annotations are relative.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Well-Defined NRC Queries Can Be Typed - (Extended Abstract).
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012
Principles of Provenance (Dagstuhl Seminar 12091).
Dagstuhl Reports, 2012

The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs.
Proceedings of the Foundations of Information and Knowledge Systems, 2012

A Structural Approach to Indexing Triples.
Proceedings of the Semantic Web: Research and Applications, 2012

Storing and Indexing Massive RDF Datasets.
Proceedings of the Semantic Search over the Web, 2012

2011
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management, 2011

Relative expressive power of navigational querying on graphs.
Proceedings of the Database Theory, 2011

On guarded simulations and acyclic first-order languages.
Proceedings of the Database Programming Languages, 2011

2010
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data.
ACM Trans. Web, 2010

Towards a theory of search queries.
ACM Trans. Database Syst., 2010

Inference of concise regular expressions and DTDs.
ACM Trans. Database Syst., 2010

A Graph Model of Data and Workflow Provenance.
Proceedings of the 2nd Workshop on the Theory and Practice of Provenance, 2010

2009
XML Typechecking.
Proceedings of the Encyclopedia of Database Systems, 2009

Structural Recursion as a Query Language on Lists and Ordered Trees.
Theory Comput. Syst., 2009

Provenance: a future history.
Proceedings of the Companion to the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009

2008
On the expressiveness of implicit provenance in query and update languages.
ACM Trans. Database Syst., 2008

Scalable multi-query optimization for exploratory queries over federated scientific databases.
Proc. VLDB Endow., 2008

SchemaScope: a system for inferring and cleaning XML schemas.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Curated databases.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

2007
Polymorphic type inference for the named nested relational calculus.
ACM Trans. Comput. Log., 2007

Well-definedness and semantic type-checking for the nested relational calculus.
Theor. Comput. Sci., 2007

On deciding well-definedness for query languages on trees.
J. ACM, 2007

Recording Provenance for SQL Queries and Updates.
IEEE Data Eng. Bull., 2007

Inferring XML Schema Definitions from XML Data.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

A crash course on database queries.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Non-linear prefixes in query languages.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Structural Recursion on Ordered Trees and List-Based Complex Objects.
Proceedings of the Database Theory, 2007

2006
Type inference for unique pattern matching.
ACM Trans. Program. Lang. Syst., 2006

A Provenance Model for Manually Curated Data.
Proceedings of the Provenance and Annotation of Data, 2006

2005
Well-definedness, semantic type-checking and type inference for database query languages
PhD thesis, 2005

Towards practical meta-querying.
Inf. Syst., 2005

On the complexity of deciding typability in the relational algebra.
Acta Informatica, 2005

Deciding well-definedness of XQuery fragments.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract.
Proceedings of the Database Theory, 2005

2004
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery
CoRR, 2004

Meta-SQL: Towards Practical Meta-Querying.
Proceedings of the Advances in Database Technology, 2004

2003
Unique Pattern Matching in Strings
CoRR, 2003


  Loading...