default search action
Stijn Vansummeren
Person information
- affiliation: Hasselt University, Belgium
- affiliation (former): Université libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j37]Dean Light, Ahmad Aiashi, Mahmoud Diab, Daniel Nachmias, Stijn Vansummeren, Benny Kimelfeld:
SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow. Proc. VLDB Endow. 17(12): 4281-4284 (2024) - [c47]Peter Buneman, Stijn Vansummeren:
Annotation and More Annotation: Some Problems Posed by (and to) Val Tannen. Tannen's Festschrift 2024: 4:1-4:8 - [c46]Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc:
Compact Path Representations for Graph Database Pattern Matching. ICDEW 2024: 379-380 - [c45]Marcel Parciak, Sebastiaan Weytjens, Niel Hens, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Measuring Approximate Functional Dependencies: A Comparative Study. ICDE 2024: 3505-3518 - [c44]Thomas Muñoz
, Cristian Riveros, Stijn Vansummeren
Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility. ICDT 2024: 12:1-12:20 - [c43]Marcel Parciak, Brecht Vandevoort, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Schema Matching with Large Language Models: an Experimental Study. VLDB Workshops 2024 - [i23]Marcel Parciak, Brecht Vandevoort, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Schema Matching with Large Language Models: an Experimental Study. CoRR abs/2407.11852 (2024) - [i22]Dean Light, Ahmad Aiashy, Mahmoud Diab, Daniel Nachmias, Stijn Vansummeren, Benny Kimelfeld:
SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow. CoRR abs/2409.01736 (2024) - 2023
- [j36]Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc:
Representing Paths in Graph Database Pattern Matching. Proc. VLDB Endow. 16(7): 1790-1803 (2023) - [j35]Niels Bylois, Frank Neven, Stijn Vansummeren:
CM-Explorer: Dissecting Data Ingestion Problems. Proc. VLDB Endow. 16(12): 3958-3961 (2023) - [j34]Stijn Vansummeren:
Technical Perspective: Conjunctive Queries with Comparisons. SIGMOD Rec. 52(1): 53 (2023) - [j33]Sergi Nadal
Graph-Driven Federated Data Management. IEEE Trans. Knowl. Data Eng. 35(1): 509-520 (2023) - [c42]Niels Bylois
Data Ingestion Validation through Stable Conditional Metrics with Ranking and Filtering. ADBIS 2023: 210-223 - [c41]Jeroen Bollen
Learning Graph Neural Networks using Exact Compression. GRADES-NDA@SIGMOD 2023: 8:1-8:9 - [i21]Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren:
Learning Graph Neural Networks using Exact Compression. CoRR abs/2304.14793 (2023) - [i20]Thomas Muñoz, Cristian Riveros, Stijn Vansummeren:
Enumeration and updates for conjunctive linear algebra queries through expressibility. CoRR abs/2310.04118 (2023) - [i19]Marcel Parciak
Measuring Approximate Functional Dependencies: a Comparative Study. CoRR abs/2312.06296 (2023) - 2022
- [j32]Marco Bucchi, Alejandro Grez, Andrés Quintana, Cristian Riveros
CORE: a COmplex event Recognition Engine. Proc. VLDB Endow. 15(9): 1951-1964 (2022) - [c40]Sergi Nadal
Graph-Driven Federated Data Management (Extended Abstract). ICDE 2022: 1507-1508 - [c39]Stijn Vansummeren
Getting to the CORE of Complex Event Recognition (Invited Talk). TIME 2022: 3:1-3:2 - [i18]Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc:
Representing Paths in Graph Database Pattern Matching. CoRR abs/2207.13541 (2022) - 2021
- [j31]Alejandro Grez, Cristian Riveros
A Formal Framework for Complex Event Recognition. ACM Trans. Database Syst. 46(4): 16:1-16:49 (2021) - [i17]Marco Bucchi, Alejandro Grez, Andrés Quintana, Cristian Riveros, Stijn Vansummeren:
CORE: a COmplex event Recognition Engine. CoRR abs/2111.04635 (2021) - 2020
- [j30]Jelle Hellings, Marc Gyssens
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - [j29]Alexander Artikis, Thomas Eiter, Alessandro Margara, Stijn Vansummeren:
Dagstuhl Seminar on the Foundations of Composite Event Recognition. SIGMOD Rec. 49(4): 24-27 (2020) - [j28]Fernando Florenzano, Cristian Riveros
Efficient Enumeration Algorithms for Regular Document Spanners. ACM Trans. Database Syst. 45(1): 3:1-3:42 (2020) - [j27]Muhammad Idris
General dynamic Yannakakis: conjunctive queries with theta joins under updates. VLDB J. 29(2-3): 619-653 (2020) - [c38]Alejandro Grez, Cristian Riveros, Martín Ugarte, Stijn Vansummeren:
On the Expressiveness of Languages for Complex Event Recognition. ICDT 2020: 15:1-15:17 - [i16]Alexander Artikis, Thomas Eiter, Alessandro Margara, Stijn Vansummeren:
Foundations of Composite Event Recognition (Dagstuhl Seminar 20071). Dagstuhl Reports 10(2): 19-49 (2020)
2010 – 2019
- 2019
- [j26]Sergi Nadal
An integration-oriented ontology to govern evolution in Big Data ecosystems. Inf. Syst. 79: 3-19 (2019) - [j25]Muhammad Idris
Efficient Query Processing for Dynamically Changing Datasets. SIGMOD Rec. 48(1): 33-40 (2019) - [i15]Iman Elghandour, Ahmet Kara, Dan Olteanu, Stijn Vansummeren:
Incremental Techniques for Large-Scale Dynamic Query Processing. CoRR abs/1902.00585 (2019) - [i14]Muhammad Idris, Martín Ugarte, Stijn Vansummeren, Hannes Voigt, Wolfgang Lehner
Conjunctive Queries with Theta Joins Under Updates. CoRR abs/1905.09848 (2019) - 2018
- [j24]Muhammad Idris
Conjunctive Queries with Inequalities Under Updates. Proc. VLDB Endow. 11(7): 733-745 (2018) - [c37]Martín Ugarte, Stijn Vansummeren:
On the Difference between Complex Event Processing and Dynamic Query Evaluation. AMW 2018 - [c36]Iman Elghandour, Ahmet Kara
Incremental Techniques for Large-Scale Dynamic Query Processing. CIKM 2018: 2297-2298 - [c35]Sergi Nadal
MDM: Governing Evolution in Big Data Ecosystems. EDBT 2018: 682-685 - [c34]Fernando Florenzano, Cristian Riveros
Constant Delay Algorithms for Regular Document Spanners. PODS 2018: 165-177 - [r2]Véronique Benzaken, Giuseppe Castagna, Haruo Hosoya, Benjamin C. Pierce, Stijn Vansummeren:
XML Typechecking. Encyclopedia of Database Systems (2nd ed.) 2018 - [i13]Sergi Nadal, Oscar Romero, Alberto Abelló, Panos Vassiliadis, Stijn Vansummeren:
An Integration-Oriented Ontology to Govern Evolution in Big Data Ecosystems. CoRR abs/1801.05161 (2018) - [i12]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. CoRR abs/1803.01390 (2018) - [i11]Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Domagoj Vrgoc:
Constant delay algorithms for regular document spanners. CoRR abs/1803.05277 (2018) - 2017
- [j23]Sergi Nadal
A software reference architecture for semantic-aware Big Data systems. Inf. Softw. Technol. 90: 75-92 (2017) - [c33]Alexander Artikis, Alessandro Margara, Martín Ugarte, Stijn Vansummeren, Matthias Weidlich
Complex Event Recognition Languages: Tutorial. DEBS 2017: 7-10 - [c32]Sergi Nadal, Oscar Romero, Alberto Abelló, Panos Vassiliadis, Stijn Vansummeren:
An Integration-Oriented Ontology to Govern Evolution in Big Data Ecosystems. EDBT/ICDT Workshops 2017 - [c31]Muhammad Idris
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates. SIGMOD Conference 2017: 1259-1274 - [i10]Alejandro Grez, Cristian Riveros, Martín Ugarte, Stijn Vansummeren:
A Second-Order Approach to Complex Event Recognition. CoRR abs/1712.01063 (2017) - 2016
- [j22]Jonny Daenen, Frank Neven
Parallel Evaluation of Multi-Semi-Joins. Proc. VLDB Endow. 9(10): 732-743 (2016) - [j21]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Declarative Cleaning of Inconsistencies in Information Extraction. ACM Trans. Database Syst. 41(1): 6:1-6:44 (2016) - [c30]Erik Agterdenbos, George H. L. Fletcher, Chee-Yong Chan, Stijn Vansummeren:
Empirical evaluation of guarded structural indexing. EDBT 2016: 714-715 - [c29]Yoav Nahshon
Incorporating information extraction in the relational database model. WebDB 2016: 6 - [i9]Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren:
Parallel Evaluation of Multi-Semi-Joins. CoRR abs/1605.05219 (2016) - 2015
- [j20]George H. L. Fletcher, Marc Gyssens
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. Ann. Math. Artif. Intell. 73(1-2): 167-203 (2015) - [j19]Dimitri Surinx, George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs using transitive closure. Log. J. IGPL 23(5): 759-788 (2015) - [j18]George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs. Inf. Sci. 298: 390-406 (2015) - [j17]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Document Spanners: A Formal Approach to Information Extraction. J. ACM 62(2): 12:1-12:51 (2015) - [j16]George H. L. Fletcher, Marc Gyssens
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J. Log. Comput. 25(3): 549-580 (2015) - [j15]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
A Relational Framework for Information Extraction. SIGMOD Rec. 44(4): 5-16 (2015) - [c28]Jelle Hellings, Marc Gyssens
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL 2015: 59-68 - [c27]Wim Martens, Frank Neven
SCULPT: A Schema Language for Tabular Data on the Web. WWW 2015: 702-720 - [e2]Esteban Zimányi, Stijn Vansummeren, Toon Calders:
Actes des 11es journées francophones sur les Entrepôts de Données et l'Analyse en Ligne, EDA 2015, Bruxelles, Belgique, 2-3 avril 2015. RNTI B-11, Hermann-Éditions 2015 [contents] - 2014
- [j14]Marcelo Arenas, Jonny Daenen, Frank Neven
Discovering XSD Keys from XML Data. ACM Trans. Database Syst. 39(4): 28:1-28:49 (2014) - [c26]François Picalausa, George H. L. Fletcher, Jan Hidders, Stijn Vansummeren:
Principles of Guarded Structural Indexing. ICDT 2014: 245-256 - [c25]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Cleaning inconsistencies in information extraction via prioritized repairs. PODS 2014: 164-175 - [i8]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative Expressive Power of Navigational Querying on Graphs. CoRR abs/1401.8201 (2014) - [i7]Wim Martens, Frank Neven, Stijn Vansummeren:
SCULPT: A Schema Language for Tabular Data on the Web. CoRR abs/1411.2351 (2014) - 2013
- [c24]Jan Van den Bussche
Well-Defined NRC Queries Can Be Typed - (Extended Abstract). In Search of Elegance in the Theory and Practice of Computation 2013: 494-506 - [c23]Peter Buneman, Egor V. Kostylev
Annotations are relative. ICDT 2013: 177-188 - [c22]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Spanners: a formal framework for information extraction. PODS 2013: 37-48 - [c21]Marcelo Arenas, Jonny Daenen, Frank Neven
Discovering XSD keys from XML data. SIGMOD Conference 2013: 61-72 - 2012
- [c20]François Picalausa, Yongming Luo, George H. L. Fletcher, Jan Hidders
A Structural Approach to Indexing Triples. ESWC 2012: 406-421 - [c19]George H. L. Fletcher, Marc Gyssens
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs. FoIKS 2012: 124-143 - [p1]Yongming Luo, François Picalausa, George H. L. Fletcher, Jan Hidders
Storing and Indexing Massive RDF Datasets. Semantic Search over the Web 2012: 31-60 - [i6]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. CoRR abs/1210.2688 (2012) - [i5]James Cheney
Principles of Provenance (Dagstuhl Seminar 12091). Dagstuhl Reports 2(2): 84-113 (2012) - 2011
- [c18]George H. L. Fletcher, Jan Hidders, Stijn Vansummeren, Yongming Luo, François Picalausa, Paul De Bra:
On guarded simulations and acyclic first-order languages. DBPL 2011 - [c17]George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs. ICDT 2011: 197-207 - [c16]François Picalausa, Stijn Vansummeren:
What are real SPARQL queries like? SWIM 2011: 7 - 2010
- [j13]Geert Jan Bex, Frank Neven
Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2): 11:1-11:47 (2010) - [j12]George H. L. Fletcher, Jan Van den Bussche
Towards a theory of search queries. ACM Trans. Database Syst. 35(4): 28:1-28:33 (2010) - [j11]Geert Jan Bex, Wouter Gelade, Frank Neven
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. ACM Trans. Web 4(4): 14:1-14:32 (2010) - [c15]Umut A. Acar, Peter Buneman, James Cheney, Jan Van den Bussche, Natalia Kwasnikowska, Stijn Vansummeren:
A Graph Model of Data and Workflow Provenance. TaPP 2010 - [i4]Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren:
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. CoRR abs/1004.2372 (2010)
2000 – 2009
- 2009
- [j10]Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren:
Structural Recursion as a Query Language on Lists and Ordered Trees. Theory Comput. Syst. 44(4): 590-619 (2009) - [c14]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ICDT 2009: 201-211 - [c13]James Cheney
Provenance: a future history. OOPSLA Companion 2009: 957-964 - [r1]Véronique Benzaken, Giuseppe Castagna, Haruo Hosoya, Benjamin C. Pierce, Stijn Vansummeren:
XML Typechecking. Encyclopedia of Database Systems 2009: 3646-3650 - 2008
- [j9]Anastasios Kementsietsidis, Frank Neven
Scalable multi-query optimization for exploratory queries over federated scientific databases. Proc. VLDB Endow. 1(1): 16-27 (2008) - [j8]Peter Buneman, James Cheney
On the expressiveness of implicit provenance in query and update languages. ACM Trans. Database Syst. 33(4): 28:1-28:47 (2008) - [c12]Peter Buneman, James Cheney, Wang Chiew Tan, Stijn Vansummeren:
Curated databases. PODS 2008: 1-12 - [c11]Geert Jan Bex, Frank Neven
SchemaScope: a system for inferring and cleaning XML schemas. SIGMOD Conference 2008: 1259-1262 - [c10]Geert Jan Bex, Wouter Gelade, Frank Neven
Learning deterministic regular expressions for the inference of schemas from XML data. WWW 2008: 825-834 - 2007
- [j7]Stijn Vansummeren, James Cheney:
Recording Provenance for SQL Queries and Updates. IEEE Data Eng. Bull. 30(4): 29-37 (2007) - [j6]Stijn Vansummeren:
On deciding well-definedness for query languages on trees. J. ACM 54(4): 19 (2007) - [j5]Jan Van den Bussche
Well-definedness and semantic type-checking for the nested relational calculus. Theor. Comput. Sci. 371(3): 183-199 (2007) - [j4]Jan Van den Bussche, Stijn Vansummeren:
Polymorphic type inference for the named nested relational calculus. ACM Trans. Comput. Log. 9(1): 3 (2007) - [c9]Peter Buneman, James Cheney
On the Expressiveness of Implicit Provenance in Query and Update Languages. ICDT 2007: 209-223 - [c8]Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren:
Structural Recursion on Ordered Trees and List-Based Complex Objects. ICDT 2007: 344-358 - [c7]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
A crash course on database queries. PODS 2007: 143-154 - [c6]Antonio Badia, Stijn Vansummeren:
Non-linear prefixes in query languages. PODS 2007: 185-194 - [c5]Geert Jan Bex, Frank Neven, Stijn Vansummeren:
Inferring XML Schema Definitions from XML Data. VLDB 2007: 998-1009 - 2006
- [j3]Stijn Vansummeren:
Type inference for unique pattern matching. ACM Trans. Program. Lang. Syst. 28(3): 389-428 (2006) - [c4]Peter Buneman, Adriane Chapman, James Cheney
A Provenance Model for Manually Curated Data. IPAW 2006: 162-170 - [e1]Stijn Vansummeren:
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA. ACM 2006, ISBN 1-59593-318-2 [contents] - 2005
- [b1]Stijn Vansummeren:
Well-definedness, semantic type-checking and type inference for database query languages. Hasselt University, Belgium, 2005 - [j2]Stijn Vansummeren:
On the complexity of deciding typability in the relational algebra. Acta Informatica 41(6): 367-381 (2005) - [j1]Jan Van den Bussche
Towards practical meta-querying. Inf. Syst. 30(4): 317-332 (2005) - [c3]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract. ICDT 2005: 99-113 - [c2]Stijn Vansummeren:
Deciding well-definedness of XQuery fragments. PODS 2005: 37-48 - 2004
- [c1]Jan Van den Bussche
Meta-SQL: Towards Practical Meta-Querying. EDBT 2004: 823-825 - [i3]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. CoRR cs.DB/0406060 (2004) - 2003
- [i2]Stijn Vansummeren:
Unique Pattern Matching in Strings. CoRR cs.PL/0302004 (2003) - 2002
- [i1]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Towards practical meta-querying. CoRR cs.DB/0202037 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: