Jelle Hellings

According to our database1, Jelle Hellings authored at least 39 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Practical View-Change-Less Protocol through Rapid View Synchronization.
CoRR, 2023

Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees.
LICS, 2023

2022
The power of Tarski's relation algebra on trees.
J. Log. Algebraic Methods Program., 2022

On the Correctness of Speculative Consensus.
CoRR, 2022

Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules.
Proceedings of the Foundations of Information and Knowledge Systems, 2022

The Fault-Tolerant Cluster-Sending Problem.
Proceedings of the Foundations of Information and Knowledge Systems, 2022

2021
Fault-Tolerant Distributed Transactions on Blockchain
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01877-0, 2021

ByShard: Sharding in a Byzantine Environment.
Proc. VLDB Endow., 2021

Byzantine Cluster-Sending in Expected Constant Communication.
CoRR, 2021

From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization.
Comput. J., 2021

RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation.
Proceedings of the 24th International Conference on Extending Database Technology, 2021

2020
Scalable, Resilient and Configurable Permissioned Blockchain Fabric.
Proc. VLDB Endow., 2020

ResilientDB: Global Scale Resilient Blockchain Fabric.
Proc. VLDB Endow., 2020

Building High Throughput Permissioned Blockchain Fabrics: Challenges and Opportunities.
Proc. VLDB Endow., 2020

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees.
Inf. Syst., 2020

Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing.
CoRR, 2020

Explaining Results of Path Queries on Graphs - Single-Path Results for Context-Free Path Queries.
Proceedings of the Software Foundations for Data Interoperability and Large Scale Graph Data Analytics, 2020

Stab-Forests: Dynamic Data Structures for Efficient Temporal Query Processing.
Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

Coordination-Free Byzantine Replication with Minimal Communication Costs.
Proceedings of the 23rd International Conference on Database Theory, 2020

Blockchain consensus unraveled: virtues and limitations.
Proceedings of the 14th ACM International Conference on Distributed and Event-based Systems, 2020

2019
Calculi for symmetric queries.
J. Comput. Syst. Sci., 2019

Scaling Blockchain Databases through Parallel Resilient Consensus Paradigm.
CoRR, 2019

Revisiting consensus protocols through wait-free parallelization.
CoRR, 2019

First-order definable counting-only queries.
Ann. Math. Artif. Intell., 2019

Brief Announcement: The Fault-Tolerant Cluster-Sending Problem.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

An In-Depth Look of BFT Consensus in Blockchain: Challenges and Opportunities.
Proceedings of the 20th International Middleware Conference Tutorials, 2019

2018
On Tarski's Relation Algebra: Querying trees and chains, and the semi-join algebra
PhD thesis, 2018

Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees.
CoRR, 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


  Loading...