> The benchmarks are all for numerical computing, where the hard work is typically offloaded to a BLAS library anyway, and don't involve strings or dictionaries.
I built an in-memory relational query compiler in Julia which keeps up with Postgres on the Join Order Benchmark.
Last I checked there were still some limitations around stack-allocation of types containing pointers, which is occasionally painful, but other than that it gave me all the tools I could possibly want.
The startup time is annoying, but I typically use Julia from Juno and I restart at most a couple of times per week. Ctrl-shift-enter recompiles the current module, which is usually all I want.
I built an in-memory relational query compiler in Julia which keeps up with Postgres on the Join Order Benchmark.
http://scattered-thoughts.net/blog/2016/10/11/a-practical-re...
Last I checked there were still some limitations around stack-allocation of types containing pointers, which is occasionally painful, but other than that it gave me all the tools I could possibly want.
https://github.com/JuliaLang/julia/pull/18632
The startup time is annoying, but I typically use Julia from Juno and I restart at most a couple of times per week. Ctrl-shift-enter recompiles the current module, which is usually all I want.