World's Best Scientists 2026 revealed!
Jan Van den Bussche

Jan Van den Bussche

D-Index & Metrics

Computer Science

D-Index
32
Citations
5357
World Ranking
13036
National Ranking
123

Overview

Jan Van den Bussche is affiliated with Hasselt University in Belgium and works primarily in the field of Computer Science. Their research spans various subfields, including Artificial Intelligence, Computer Networks and Communications, Information Systems, Computational Theory and Mathematics, and Molecular Biology.

The main topics covered in their work include:

  • Semantic Web and Ontologies
  • Advanced Database Systems and Queries
  • Service-Oriented Architecture and Web Services
  • Scientific Computing and Data Management
  • Algorithms and Data Compression
  • DNA and Biological Computing
  • Logic, Reasoning, and Knowledge

Van den Bussche has authored numerous publications, with recent papers that include:

  • "Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time" (2020), published in Lirias (KU Leuven)
  • "Executable First-Order Queries in the Logic of Information Flows" (2020), published in VUBIR (Vrije Universiteit Brussel)
  • "Matrix Query Languages" (2021), published in ACM SIGMOD Record
  • "Temporal graph patterns by timed automata" (2023), published in The VLDB Journal
  • "Toward a Solid Acceptance of the Decentralized Web of Personal Data: Societal and Technological Convergence" (2023), published in Communications of the ACM

The frequent publication venues where their work appears include:

  • arXiv (Cornell University)
  • Logical Methods in Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Lirias (KU Leuven)
  • The VLDB Journal

Van den Bussche has collaborated extensively with other researchers. Some of their frequent coauthors are:

  • Bart Bogaerts
  • Heba Aamer
  • Maxime Jakubowski
  • Dimitri Surinx
  • Eugenia Ternovska

Best Publications

  • The Open Provenance Model core specification (v1.1)

    Luc Moreau;Ben Clifford;Juliana Freire;Joe Futrelle

  • A graph-oriented object database model

    M. Gyssens;J. Paredaens;J. van den Bussche;D. van Gucht

  • DTDs versus XML schema: a practical study

    Geert Jan Bex;Frank Neven;Jan Van den Bussche

  • Towards a theory of spatial database queries

    J. Paredaens;J. Van den Bussche;D. Van Gucht

  • Towards a theory of spatial database queries (extended abstract)

    Jan Paredaens;Jan Van den Bussche;Dirk Van Gucht

  • Relational transducers for declarative networking

    Tom J. Ameloot;Frank Neven;Jan Van Den Bussche

  • Temporal versus first-order logic to query temporal databases

    Serge Abiteboul;Laurent Herr;Jan Van den Bussche

  • First-Order Queries on Finite Structures Over the Reals

    Jan Paredaens;Jan Vanden Bussche;Dirk Van Gucht

  • Relational Association Rules: Getting WARMeR

    Bart Goethals;Jan Van den Bussche

  • First-order queries on finite structures over the reals

    J. Paredaens;J. Van den Bussche;D. Van Gucht

  • The Open Provenance Model (v1.01)

    Luc Moreau;Beth Plale;Simon Miles;Carole Goble

  • A tight upper bound on the number of candidate patterns

    F. Geerts;B. Goethals;J. Van den Bussche

  • Relative expressive power of navigational querying on graphs

    George H.L. Fletcher;Marc Gyssens;Dirk Leinders;Dimitri Surinx

  • Lossless Representation of Topological Spatial Data

    Bart Kuijpers;Jan Paredaens;Jan Van den Bussche

  • On Supporting Interactive Association Rule Mining

    Bart Goethals;Jan Van den Bussche

  • Concepts for Graph-Oriented Object Manipulation

    Marc Andries;Marc Gemis;Jan Paredaens;Inge Thyssens

  • An overview of GOOD

    Jan Paredaens;Jan Van den Bussche;Marc Andries;Marc Gemis

  • DFL: A dataflow language based on Petri nets and nested relational calculus

    Jan Hidders;Natalia Kwasnikowska;Jacek Sroka;Jerzy Tyszkiewicz

  • An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries

    Jan Van den Bussche;Gottfried Vossen

  • Information Extraction in Structured Documents Using Tree Automata Induction

    Raymond Kosala;Jan Van den Bussche;Maurice Bruynooghe;Hendrik Blockeel

  • Expressiveness of structured document query languages based on attribute grammars

    Frank Neven;Jan Van Den Bussche

  • Complete Geometric Query Languages

    Marc Gyssens;Jan Van den Bussche;Dirk Van Gucht

  • A Tight Upper Bound on the Number of Candidate Patterns

    Floris Geerts;Bart Goethals;Jan Van den Bussche

Frequent Co-Authors

Floris Geerts
Floris Geerts University of Antwerp
Frank Neven
Frank Neven Hasselt University
Bart Goethals
Bart Goethals University of Antwerp
Gottfried Vossen
Gottfried Vossen University of Münster
Yuri Gurevich
Yuri Gurevich University of Michigan–Ann Arbor
Marc Denecker
Marc Denecker KU Leuven
Serge Abiteboul
Serge Abiteboul École Normale Supérieure
Victor Vianu
Victor Vianu University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees opens diverse opportunities for anyone passionate about technology, regardless of background or schedule. Students can start with an associate's degree online to build foundational skills, then transfer credits toward a bachelor’s or pursue direct entry into the workforce.

For those seeking advanced roles, earning graduate degrees that are worth it can lead to specialized positions and higher salaries. Even if your academic transcript isn’t perfect, options are available—search for online graduate programs that accept 2.0 gpa and discover flexible pathways to career growth.

Cost and speed matter to many learners. You’ll find a range of cheap online degrees fast so you can earn your credentials efficiently without taking on excessive student debt. Whether you are entering the field or upskilling, online computer science education offers flexible, accessible routes to rewarding tech careers.

Best Scientists Citing Jan Van den Bussche

Trending Scientists