# Jelle Hellings

According to our database

Collaborative distances:

^{1}, Jelle Hellings authored at least 12 papers between 2011 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

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

CoRR, 2018

The Power of Tarski's Relation Algebra on Trees.

Proceedings of the Foundations of Information and Knowledge Systems, 2018

First-Order Definable Counting-Only Queries.

Proceedings of the Foundations of Information and Knowledge Systems, 2018

2017

From relation algebra to semi-join algebra: an approach for graph query optimization.

Proceedings of The 16th International Symposium on Database Programming Languages, 2017

2016

Implication and axiomatization of functional and constant constraints.

Ann. Math. Artif. Intell., 2016

2015

Path Results for Context-free Grammar Queries on Graphs.

CoRR, 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

Conjunctive Context-Free Path Queries.

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

Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model.

Proceedings of the Foundations of Information and Knowledge Systems, 2014

2013

Walk logic as a framework for path query languages on graph databases.

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Efficient external-memory bisimulation on DAGs.

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

2011

I/O efficient bisimulation partitioning on very large directed acyclic graphs

CoRR, 2011