rayed-bqn
CBQN
| rayed-bqn | CBQN | |
|---|---|---|
| 1 | 4 | |
| 27 | 297 | |
| - | - | |
| 9.6 | 9.5 | |
| about 1 month ago | 7 days ago | |
| PowerShell | C | |
| MIT License | GNU General Public License v3.0 only |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
rayed-bqn
CBQN
-
Building a faster hash table for high performance SQL joins
Worth pointing out that this can depend a lot more on fiddly details than you might expect. In particular, you're dealing with a small fixed width allowing the hash to be stored in the table instead of the key. The article emphasizes variable-length keys, and I don't see any specialization on key sizes (if 4- and 8-byte keys aren't common then this makes sense; if they are then I'd expect dedicated table code for those sizes to be valuable). And set lookups are also just a bit different from value lookups. I think these cases are different enough that I have no idea if the results would carry over, although I can see how the bidirectional approach would reduce probing more than RH which seems good.
...and since I've done a lot of work with Robin Hood on small-key lookups, I can point out some little tweaks that have made a big difference for me. I have 8-byte lookups at just over 3ns/lookup[0], albeit at a very low load factor, typically <50%. A key step was to use the maximum possible hash as a sentinel value, handling it specially in case it shows up in the data. This way, instead of probing until finding an empty bucket or greater hash, probing just finds the first slot that's greater than or equal to the requested key's hash. So the lookup code[1] is very simple (the rest, not so much). The while loop is only needed on a hash collision, so at a low load factor a lookup is effectively branchless. However, these choices are specialized for a batched search where the number of insertions never has to be higher than the number of searches, and all the insertions can be done first. And focused on small-ish (under a million entries) tables.
[0] https://mlochbaum.github.io/bencharray/pages/search.html
[1] https://github.com/dzaima/CBQN/blob/5c7ab3f/src/singeli/src/...
-
Having trouble installing bqn into arch
It sounds like you might be trying to install the package manually from the AUR? Generally you should do this only once, for an AUR helper such as pacaur, so you can install with pacaur -S bqn. The instructions in the CBQN repository also work for installing without a package manager, which is the easiest way to enable replxx.
-
Programming Style Influences
It's still utterly verbose compared to the ngn/k source or even CBQN source.
-
BQN Example
CBQN Source, and Install Instructions
What are some alternatives?
BQN - An APL-like programming language. Self-hosted!
Singeli - High-level interface for low-level programming
CSpydr - A static typed low-level compiled programming language inspired by Rust and C
gravity - Gravity Programming Language
adorad - Fast, Expressive, & High-Performance Programming Language for those who dare
wasm-micro-runtime - WebAssembly Micro Runtime (WAMR)
hashtable-benchmarks - An Evaluation of Linear Probing Hashtable Algorithms
QuestDB - An open source time-series database for fast ingest and SQL queries