Jan Van den Bussche

According to our database1, Jan Van den Bussche
  • authored at least 193 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On the expressive power of query languages for matrices.
CoRR, 2017

J-Logic: Logical Foundations for JSON Querying.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

The primitivity of operators in the algebra of binary relations under conjunctions of containments.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries.
VLDB J., 2016

Putting logic-based distributed systems on stable grounds.
TPLP, 2016

On the Satisfiability Problem for SPARQL Patterns.
J. Artif. Intell. Res., 2016

Learning with Value-Ramp.
CoRR, 2016

2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
A Formal Account of the Open Provenance Model.
TWEB, 2015

Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors.
Neural Computation, 2015

Deciding Confluence for a Simple Class of Relational Transducer Networks.
Theory Comput. Syst., 2015

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

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.
J. UCS, 2015

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

Relative expressive power of navigational querying on graphs using transitive closure.
Logic Journal of the IGPL, 2015

Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries.
CoRR, 2015

Putting Logic-Based Distributed Systems on Stable Grounds.
CoRR, 2015

Convergence in Navigational Reinforcement Learning.
CoRR, 2015

On the Power of SPARQL in Expressing Navigational Queries.
Comput. J., 2015

The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs.
Ann. Math. Artif. Intell., 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

Positive Dedalus programs tolerate non-causality.
J. Comput. Syst. Sci., 2014

On the primitivity of operators in SPARQL.
Inf. Process. Lett., 2014

Inconsistency-tolerant reasoning with OWL DL.
Int. J. Approx. Reasoning, 2014

On the satisfiability problem for SPARQL patterns.
CoRR, 2014

Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference.
CoRR, 2014

Relative Expressive Power of Navigational Querying on Graphs.
CoRR, 2014

FO(C): A Knowledge Representation Language of Causality.
CoRR, 2014

FO(C) and Related Modelling Paradigms.
CoRR, 2014

Inference in the FO(C) Modelling Language.
CoRR, 2014

Inference in the FO(C) Modelling Language.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
Graph-theoretic formalization of hybridization in DNA sticker complexes.
Natural Computing, 2013

Relational transducers for declarative networking.
J. ACM, 2013

Preface.
Fundam. Inform., 2013

Discovering XSD keys from XML data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

On the expressive power of update primitives.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Walk logic as a framework for path query languages on graph databases.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

The DNA query language DNAQL.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Querying an Integrated Complex-Object Dataflow Database.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 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

Quantitatively Evaluating Formula-Variable Relevance by Forgetting.
Proceedings of the Advances in Artificial Intelligence, 2013

2012
A comparison of graph-theoretic DNA hybridization models.
Theor. Comput. Sci., 2012

The Navigational Power of Web Browsers.
Theory Comput. Syst., 2012

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

Deciding eventual consistency for a simple class of relational transducer networks.
Proceedings of the 15th International Conference on Database Theory, 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 Type System for DNAQL.
Proceedings of the DNA Computing and Molecular Programming - 18th International Conference, 2012

On the CRON Conjecture.
Proceedings of the Datalog in Academia and Industry - Second International Workshop, 2012

2011
Relational completeness of query languages for annotated databases.
J. Comput. Syst. Sci., 2011

The Open Provenance Model core specification (v1.1).
Future Generation Comp. Syst., 2011

Relational transducers for declarative networking.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Expressive Power of Safe First-Order Logical Decision Trees.
Proceedings of the Inductive Logic Programming - 21st International Conference, 2011

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

Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes.
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

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

Relational transducers for declarative networking
CoRR, 2010

Mining tree-query associations in graphs
CoRR, 2010

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

Database Theory, Yuri, and Me.
Proceedings of the Fields of Logic and Computation, 2010

A Formal Model for Databases in DNA.
Proceedings of the Algebraic and Numeric Biology - 4th International Conference, 2010

2009
Database Query Processing Using Finite Cursor Machines.
Theory Comput. Syst., 2009

Introduction to PODS 2006 special section.
J. ACM, 2009

Repetitions and permutations of columns in the semijoin algebra.
ITA, 2009

Induction of Relational Algebra Expressions.
Proceedings of the Inductive Logic Programming, 19th International Conference, 2009

Towards a theory of search queries.
Proceedings of the Database Theory, 2009

2008
Learning ( k , l )-contextual tree languages for information extraction from web pages.
Machine Learning, 2008

DFL: A dataflow language based on Petri nets and nested relational calculus.
Inf. Syst., 2008

Mapping the NRC Dataflow Model to the Open Provenance Model.
Proceedings of the Provenance and Annotation of Data and Processes, 2008

2007
Introduction to the PODS 2006 special section.
ACM Trans. Database Syst., 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 the complexity of division and set joins in the relational algebra.
J. Comput. Syst. Sci., 2007

Mining for trees in a graph is NP-complete
CoRR, 2007

On the tree-transformation power of XSLT.
Acta Inf., 2007

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

Database Query Processing Using Finite Cursor Machines.
Proceedings of the Database Theory, 2007

A Formal Model of Dataflow Repositories.
Proceedings of the Data Integration in the Life Sciences, 4th International Workshop, 2007

A Theory of Stream Queries.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

Relational Completeness of Query Languages for Annotated Databases.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006
Database theory column: report on PODS 2006.
SIGACT News, 2006

Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases.
SIAM J. Comput., 2006

A characterization of first-order topological properties of planar spatial data.
J. ACM, 2006

Information extraction from structured documents using k-testable tree automaton inference.
Data Knowl. Eng., 2006

On-line topological simplification of weighted graphs
CoRR, 2006

On the tree-transformation power of XSLT
CoRR, 2006

Mining for Tree-Query Associations in a Graph.
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

On-line maintenance of simplified weighted graphs for efficient distance queries.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

The Semijoin Algebra.
Proceedings of the Foundations of Information and Knowledge Systems, 2006

2005
Tight upper bounds on the number of candidate patterns.
ACM Trans. Database Syst., 2005

The Semijoin Algebra and the Guarded Fragment.
Journal of Logic, Language and Information, 2005

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

First-order Topology Properties.
Bulletin of the EATCS, 2005

N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets.
Acta Inf., 2005

On the complexity of division and set joins in the relational algebra.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Petri Net + Nested Relational Calculus = Dataflow.
Proceedings of the On the Move to Meaningful Internet Systems 2005: CoopIS, 2005

Mining tree queries in a graph.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

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

Learning (k, l)-Contextual Tree Languages for Information Extraction.
Proceedings of the Machine Learning: ECML 2005, 2005

Mining Tree Queries in a Graph.
Proceedings of the BNAIC 2005, 2005

2004
Solving Equations in the Relational Algebra.
SIAM J. Comput., 2004

On the expressive power of semijoin queries.
Inf. Process. Lett., 2004

The semijoin algebra and the guarded fragment
CoRR, 2004

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

DTDs versus XML Schema: A Practical Study.
Proceedings of the Seventh International Workshop on the Web and Databases, 2004

A Characterization of First-Order Topological Properties of Planar Spatial Data.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

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

Finite Cursor Machines in Database Query Processing.
Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

2003
Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets
CoRR, 2003

On the expressive power of semijoin queries
CoRR, 2003

Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference.
Proceedings of the IJCAI-03, 2003

Database Interrogation Using Conjunctive Queries.
Proceedings of the Database Theory, 2003

2002
Polymorphic Type Inference for the Relational Algebra.
J. Comput. Syst. Sci., 2002

Expressiveness of structured document query languages based on attribute grammars.
J. ACM, 2002

Abstract State Machines and Computationally Complete Query Languages.
Inf. Comput., 2002

Relational Association Rules: getting WARMeR
CoRR, 2002

Towards practical meta-querying
CoRR, 2002

Distributed Computation of Web Queries Using Automata.
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Information Extraction in Structured Documents Using Tree Automata Induction.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002

Navigating with a Browser.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Relational Association Rules: Getting WARMeR.
Proceedings of the Pattern Detection and Discovery, 2002

2001
Applying an update method to a set of receivers.
ACM Trans. Database Syst., 2001

Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions.
Theor. Comput. Sci., 2001

Rewriting queries using views over monadic database schemas.
Inf. Process. Lett., 2001

Adding For-Loops to First-Order Logic.
Inf. Comput., 2001

Polymorphic type inference for the relational algebra
CoRR, 2001

Solving equations in the relational algebra
CoRR, 2001

Interactive Constrained Association Rule Mining
CoRR, 2001

A Tight Upper Bound on the Number of Candidate Patterns
CoRR, 2001

A Tight Upper Bound on the Number of Candidate Patterns.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

Applications of Alfred Tarski's Ideas in Database Theory.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Constraint databases: A tutorial introduction.
SIGMOD Record, 2000

Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane.
J. Symb. Log., 2000

On Supporting Interactive Association Rule Mining.
Proceedings of the Data Warehousing and Knowledge Discovery, 2000

Constraint Databases, Queries, and Query Languages.
Constraint Databases, 2000

Abstract State Machines and Computationally Complete Query Languages.
Proceedings of the Abstract State Machines, 2000

1999
Reminiscences on Influential Papers.
SIGMOD Record, 1999

Complete Geometric Query Languages.
J. Comput. Syst. Sci., 1999

Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases.
J. Comput. Syst. Sci., 1999

Typed Query Languages for Databases Containing Queries.
Inf. Syst., 1999

Type Inference in the Polymorphic Relational Algebra.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Adding For-Loops to First-Order Logic.
Proceedings of the Database Theory, 1999

On Capturing First-Order Topological Properties of Planar Spatial Databases.
Proceedings of the Database Theory, 1999

A priori versus a posteriori filtering of association rules.
Proceedings of the 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999

1998
First-Order Queries on Finite Structures Over the Reals.
SIAM J. Comput., 1998

Expressiveness and Complexity of Generic Graph Machines.
Theory Comput. Syst., 1998

Converting Untyped Formulas to Typed Ones.
Acta Inf., 1998

Typed Query Languages for Databases Containing Queries.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Expressiveness of Structured Document Query Languages Based on Attribute Grammars.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Topological Canonization of Planar Spatial Data and Its Incremental Maintenance.
Proceedings of the Fundamentals of Information Systems, 1998

Methods and views.
Proceedings of the 14ème Journées Bases de Données Avancées, 1998

1997
A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries.
J. Comput. Syst. Sci., 1997

On the completeness of object-creating database transformation languages.
J. ACM, 1997

Complete Geometrical Query Languages.
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

On Topological Elementary Equivalence of Spatial Databases.
Proceedings of the Database Theory, 1997

On Implementing Structured Document Query Facilities on Top of a DOOD.
Proceedings of the Deductive and Object-Oriented Databases, 5th International Conference, 1997

1996
Reflective Programming in the Relational Algebra.
J. Comput. Syst. Sci., 1996

First-Order Queries on Databases Embedded in an Infinite Structure.
Inf. Process. Lett., 1996

Temporal Versus First-Order Logic to Query Temporal Databases.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Termination Properties of Spatial Datalog Programs.
Proceedings of the Logic in Databases, 1996

1995
The Expressive Power of Complex Values in Object-Based Data Models
Inf. Comput., August, 1995

The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models.
Theor. Comput. Sci., 1995

Temporal Connectives versus Explicit Timestamps in Temporal Query Languages
Proceedings of the Recent Advances in Temporal Databases, 1995

Lossless Representation of Topological Spatial Data.
Proceedings of the Advances in Spatial Databases, 1995

Applying an Update Method to a Set of Receivers.
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

First-order Queries on Finite Structures over the Reals
Proceedings of the Proceedings, 1995

Deep Equality Revisited.
Proceedings of the Deductive and Object-Oriented Databases, 1995

1994
A Graph-Oriented Object Database Model.
IEEE Trans. Knowl. Data Eng., 1994

Towards a Theory of Spatial Database Queries.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

Expressiveness of Efficient Semi-Deterministic Choice Constructs.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Using SQL with object-oriented databases.
Inf. Syst., 1993

Complex Object Multi-Level Fixpoint Queries.
Ann. Math. Artif. Intell., 1993

On Minimizing the Forall-Not Degree of a Connective-Free Formula.
Acta Inf., 1993

GOOD: AGraph-Oriented Object Database System.
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993

Reflective Programming in the Relational Algebra.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries.
DOOD, 1993

A Computational Model for Generic Graph Functions.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

1992
An Overview of GOOD.
SIGMOD Record, 1992

Semi-determinism.
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

A Hierarchy of Faithful Set Creation in Pure OODB's.
Proceedings of the Database Theory, 1992

A Graph- and Object-Oriented Counterpart for SQL.
Future Databases, 1992

On the Completeness of Object-Creating Query Languages (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Non-Deterministic Aspects of Object-Creating Database Transformations.
Proceedings of the Modelling Database Dynamics, 1992

Concepts for Graph-Oriented Object Manipulation.
Proceedings of the Advances in Database Technology, 1992

1991
The Expressive Power of Structured Values in Pure OODB's.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

Complex Object Multi-Level Fixpoint Queries.
Proceedings of the MFDBS 91, 1991

Active Complex Object Databases (Working Paper).
Proceedings of the Third Workshop on Foundations of Models and Languages for Data and Objects, 1991

Evaluation and optimization of complex object selections.
DOOD, 1991

1990
A formal basis for extending SQL to object-oriented databases.
Bulletin of the EATCS, 1990

Using SQL with Object-Oriented Databases (Preliminary Report).
Proceedings of the Second Workshop on Foundations of Models and Languages for Data and Objects, 1990

1989
Working Group Report: Negation, Functions and Construction in Rule-Based Languages for Complex Objects.
Proceedings of the Workshop on Foundations of Models and Languages for Data and Objects, 1989

TREES: A Graphical Model for Querying Hierarchical Databases.
Proceedings of the Workshop on Foundations of Models and Languages for Data and Objects, 1989


  Loading...