Stijn Vansummeren

Proceedings of the 27th International Conference on Database Theory, 2024

2023

Graph-Driven Federated Data Management.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2023

Technical Perspective: Conjunctive Queries with Comparisons.

[BibT_eX]

[DOI]

SIGMOD Rec., 2023

Representing Paths in Graph Database Pattern Matching.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

CM-Explorer: Dissecting Data Ingestion Problems.

[BibT_eX]

[DOI]

Niels Bylois

Proc. VLDB Endow., 2023

Measuring Approximate Functional Dependencies: a Comparative Study.

[BibT_eX]

[DOI]

CoRR, 2023

Learning Graph Neural Networks using Exact Compression.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Niels Bylois

Proceedings of the Advances in Databases and Information Systems, 2023

2022

CORE: a COmplex event Recognition Engine.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Representing Paths in Graph Database Pattern Matching.

[BibT_eX]

[DOI]

CoRR, 2022

Getting to the CORE of Complex Event Recognition (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

Graph-Driven Federated Data Management (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

A Formal Framework for Complex Event Recognition.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2021

2020

General dynamic Yannakakis: conjunctive queries with theta joins under updates.

[BibT_eX]

[DOI]

VLDB J., 2020

Efficient Enumeration Algorithms for Regular Document Spanners.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2020

Dagstuhl Seminar on the Foundations of Composite Event Recognition.

[BibT_eX]

[DOI]

SIGMOD Rec., 2020

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees.

[BibT_eX]

[DOI]

Inf. Syst., 2020

Foundations of Composite Event Recognition (Dagstuhl Seminar 20071).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2020

On the Expressiveness of Languages for Complex Event Recognition.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

Efficient Query Processing for Dynamically Changing Datasets.

[BibT_eX]

[DOI]

SIGMOD Rec., 2019

An integration-oriented ontology to govern evolution in Big Data ecosystems.

[BibT_eX]

[DOI]

Inf. Syst., 2019

Conjunctive Queries with Theta Joins Under Updates.

[BibT_eX]

[DOI]

CoRR, 2019

2018

XML Typechecking.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Conjunctive Queries with Inequalities Under Updates.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Constant Delay Algorithms for Regular Document Spanners.

[BibT_eX]

[DOI]

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

MDM: Governing Evolution in Big Data Ecosystems.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

Incremental Techniques for Large-Scale Dynamic Query Processing.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

On the Difference between Complex Event Processing and Dynamic Query Evaluation.

[BibT_eX]

[DOI]

Martín Ugarte

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.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2017

A Second-Order Approach to Complex Event Recognition.

[BibT_eX]

[DOI]

CoRR, 2017

The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates.

[BibT_eX]

[DOI]

Muhammad Idris

Martín Ugarte

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Complex Event Recognition Languages: Tutorial.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

2016

Declarative Cleaning of Inconsistencies in Information Extraction.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

Parallel Evaluation of Multi-Semi-Joins.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Incorporating information extraction in the relational database model.

[BibT_eX]

[DOI]

Yoav Nahshon

Liat Peterfreund

Proceedings of the 19th International Workshop on Web and Databases, 2016

Empirical evaluation of guarded structural indexing.

[BibT_eX]

[DOI]

Erik Agterdenbos

Chee-Yong Chan

Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015

A Relational Framework for Information Extraction.

[BibT_eX]

[DOI]

SIGMOD Rec., 2015

Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Document Spanners: A Formal Approach to Information Extraction.

[BibT_eX]

[DOI]

J. ACM, 2015

Relative expressive power of navigational querying on graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Relative expressive power of navigational querying on graphs using transitive closure.

[BibT_eX]

[DOI]

Dimitri Surinx

Log. J. IGPL, 2015

The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2015

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

[BibT_eX]

[DOI]

Wim Martens

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.

[BibT_eX]

[DOI]

Proceedings of the 15th Symposium on Database Programming Languages, 2015

2014

Discovering XSD Keys from XML Data.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2014

Cleaning inconsistencies in information extraction via prioritized repairs.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Principles of Guarded Structural Indexing.

[BibT_eX]

[DOI]

Jan Hidders

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

2013

Spanners: a formal framework for information extraction.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Annotations are relative.

[BibT_eX]

[DOI]

Peter Buneman

Egor V. Kostylev

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Well-Defined NRC Queries Can Be Typed - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012

Principles of Provenance (Dagstuhl Seminar 12091).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2012

A Structural Approach to Indexing Triples.

[BibT_eX]

[DOI]

Yongming Luo

Jan Hidders

Proceedings of the Semantic Web: Research and Applications, 2012

Storing and Indexing Massive RDF Datasets.

[BibT_eX]

[DOI]

Yongming Luo

Jan Hidders

Proceedings of the Semantic Search over the Web, 2012

2011

What are real SPARQL queries like?

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Semantic Web Information Management, 2011

Relative expressive power of navigational querying on graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2011

On guarded simulations and acyclic first-order languages.

[BibT_eX]

[DOI]

Proceedings of the Database Programming Languages, 2011

2010

Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data.

[BibT_eX]

[DOI]

ACM Trans. Web, 2010

Towards a theory of search queries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2010

Inference of concise regular expressions and DTDs.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2010

A Graph Model of Data and Workflow Provenance.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on the Theory and Practice of Provenance, 2010

2009

XML Typechecking.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Structural Recursion as a Query Language on Lists and Ordered Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Provenance: a future history.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Peter Buneman

James Cheney

Anastasios Kementsietsidis

ACM Trans. Database Syst., 2008

Scalable multi-query optimization for exploratory queries over federated scientific databases.

[BibT_eX]

[DOI]

Dieter Van de Craen

Proc. VLDB Endow., 2008

SchemaScope: a system for inferring and cleaning XML schemas.

[BibT_eX]

[DOI]

Geert Jan Bex

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

Curated databases.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2007

Well-definedness and semantic type-checking for the nested relational calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On deciding well-definedness for query languages on trees.

[BibT_eX]

[DOI]

J. ACM, 2007

Recording Provenance for SQL Queries and Updates.

[BibT_eX]

[DOI]

James Cheney

IEEE Data Eng. Bull., 2007

Inferring XML Schema Definitions from XML Data.

[BibT_eX]

[DOI]

Geert Jan Bex

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

A crash course on database queries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Non-linear prefixes in query languages.

[BibT_eX]

[DOI]

Antonio Badia

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.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2007

2006

Type inference for unique pattern matching.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2006

A Provenance Model for Manually Curated Data.

[BibT_eX]

[DOI]

Proceedings of the Provenance and Annotation of Data, 2006

2005

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

[BibT_eX]

[DOI]

PhD thesis, 2005

Towards practical meta-querying.

[BibT_eX]

[DOI]

Gottfried Vossen

Inf. Syst., 2005

On the complexity of deciding typability in the relational algebra.

[BibT_eX]

[DOI]

Acta Informatica, 2005

Deciding well-definedness of XQuery fragments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2005

2004

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

[BibT_eX]

[DOI]

CoRR, 2004

Meta-SQL: Towards Practical Meta-Querying.

[BibT_eX]

[DOI]

Gottfried Vossen

Proceedings of the Advances in Database Technology, 2004

2003

Unique Pattern Matching in Strings

[BibT_eX]

[DOI]