Introducing Julius: low code and scalable graph computing in Julia

We are a group of researchers and engineers passionate about graph computing. At Julius Technologies, we have built a truly innovative graph computing solution that allows developers to build sophisticated, scalable and transparent data & analytical pipelines and systems with very little code. Compared to existing graph computing tools like Dask, Julius is much easier to use, scale and support.

This blog explains the vision behind Julius, and if you want to see some code and examples directly, use this link to the Julius tutorials, which showcases Julius’ features and capabilities. This FAQ page answers some of the most common questions.

We are excited to offer developers free access to Julius’ online development environment, where you can learn and test drive graph computing and programming using the Julius Graph Engine. The sign up link is at

For additional information, please reply to this thread, or email us directly at .


I see you have an intriguing blog, e.g. on the DSL part:

As far as I understand, while Julius is implemented in Julia, you as a user wouldn’t normally program in Julia (since “low-code”, nor other languages), but you can implement the Atoms in Julia and most other mainstream languages.

Yes, you are right. Atoms can be implemented in any languages. The DSL is really Julia macro, so Julia developers should feel right at home with the DSL,