Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
j-pb
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
47 ms
·
541.
▲
by
j-pb
5y ago
Thanks for the pointer! If anybody else want to know how this works: https://stackoverflow.com/questions/30539347/2d-morton-code-... https://en.wikipedia.org/wiki/Carry-less_product
542.
▲
by
j-pb
5y ago
Yeah, one should probably add a randomisations step for each channel for good measure. With random byte->byte lookup tables those costs should be hidden by the cache. so hash = HR[r] ^ HG[g] ^ HB[b] ^ HA[a].
543.
▲
by
j-pb
5y ago
After making the edit, I saw that someone made the same suggestion on twitter! Hilbert curves have slightly better locality than Z-curves, but Z-Curves are trivial to produce. If you have a N dimensional space over unsigned integers, then y
544.
▲
by
j-pb
5y ago
> To keep things O(n) when encoding, there's only one lookup into this array. The lookup position is determined by a “hash” of the rgba value (really just r^g^b^a). Is a bit imprecise. The algorithm would still be O(n) even with a l
545.
▲
by
j-pb
5y ago
The current iteration of the war on drugs is a "Greatest Generation" (Nixon et al.) invention and every generation since has suffered for it, but it goes back way further to prohibition times.
546.
▲
by
j-pb
5y ago
Nononono, you see; Kafka is a single writer multiple reader system and therefore highly scalable. Sadly leader-election was never implemented and the system is in a read-only state since the main died in 1924.
547.
▲
by
j-pb
5y ago
"I never thought I'd die fighting side by side with a Furry." "What about side by side with a friend?" "Aye, I could do that."
548.
▲
by
j-pb
5y ago
I've written correctness proofs for C code, both as part of my university classes and after. Unless rust has some kind of de brujn criterion (and properly formalising and bootstrapping it from a minimal core would be a step into that d
549.
▲
by
j-pb
5y ago
Definitely! Although I'm not sure if Morphic[1] is the way forward for UX on the web, despite it only being 10kloc. XD [Anybody stumbling upon this comment, and wondering what Alan Kay is/was up to, this might be a good philosophi
550.
▲
by
j-pb
5y ago
[I'm moving my comment from the flagged tree over here because I feel that it captures the spirit of my lament of Rust, and your interpretation of it being a pure endorsement of Zig, rather well.] TL;DR: Yes! But Zig is a Stand-in for
551.
▲
by
j-pb
5y ago
> throw away all of the community and things that they've built so far. The sad truth is probably, that Rusts complexity is just a mirror of the entire industry. If we, as a profession, placed a lot of value onto tiny, simple, yet w
552.
▲
by
j-pb
5y ago
To quote from Dijkstras essay "On the cruelty of really teaching computing science". > Right from the beginning, and all through the course, we stress that the programmer's task is not just to write down a program, but tha
553.
▲
by
j-pb
5y ago
> why would knowing Haskell be an advantage in the task of ensuring safety in Rust My take would be that _any_ language with a heavy emphasis on type oriented programming would be a good primer for a systems programming language which us
554.
▲
by
j-pb
5y ago
I'm not arguing that Rust should be a Common Lisp like, Waterfall style cathedral. But for something a little less unwieldy that _could_ be specified without the collaborative effort of a hundred people. (Even more relevant now that Mo
555.
▲
by
j-pb
5y ago
Thanks for the Paper! I'm looking forward to spend my weekend with it. Normally I'm a huge fan of a philosophy of backwards compatibility. Clojure has shown that it is possible with enough dedication. But I feel like it's a l
556.
▲
by
j-pb
5y ago
If anything it's rust attempt to appease C++ programmers that caused this dilemma. Both have too much complexity for verified correctness.
557.
▲
by
j-pb
5y ago
The shallowness of rusts correctness has pretty much killed my interest in it. Much of its purported virtue seems to be mostly lore and myth, and doesn't keep its promises under close inspection and scrutiny. For example the "Rust
558.
▲
by
j-pb
5y ago
Yes-ish: https://db.in.tum.de/~leis/papers/ART.pdf
559.
▲
by
j-pb
5y ago
TL;DR Your intermediary result sets can be significantly bigger than your ouput set. By instead of combining whole relations but performing a depth first search through the variable assignment space, while peforming constraint propagation,
560.
▲
by
j-pb
5y ago
The author ignores a huge amount of research done in the last 10 years on query evaluation. A series of filter operations and successive sub-selects can't reach the same performance a worst case optimal multiway join can reach (and not
561.
▲
by
j-pb
5y ago
I think you meant to write "open world principle", as every non state fact is implicitly false under the closed world assumption. But yeah I agree, that databases should always be thought of a a model of the world (crisp), and not
562.
▲
by
j-pb
5y ago
Joining the thing back together again is not so bad if with recent multi-way join algorithms. But then again, the resulting model is factually a graph database and far far away from resembling something like SQL or Relational Calculus. (Whi
563.
▲
by
j-pb
5y ago
https://en.wikipedia.org/wiki/Dunning–Kruger_effect
564.
▲
by
j-pb
5y ago
> the former is already implemented Yeah, with joins, which this entire discussion is about. > the latter Is completely tangential.
565.
▲
by
j-pb
5y ago
You seem to be stuck on the query semantic level. I can highly recomend actually building a graph database, and using it in anger in a project. You'll realize that all these paradigms are more related than they appear on the surface, t
566.
▲
by
j-pb
5y ago
Can't wait!
567.
▲
by
j-pb
5y ago
Yes, and then do a join ;) I'm not arguing for explicit joins, which are an artifact of SQL and not even the relational model e.g. Datalog as a explicit join free relational language.
568.
▲
by
j-pb
5y ago
And also not O(1) nor intuitive for any non trivial query. You don't need to have an explicit `JOIN` operator in your language, but any query that goes beyond unconditional tree walking will benefit from using joins under the hood.
569.
▲
by
j-pb
5y ago
Thanks for the insight! Having the best and brightest of the west coast database departments at your disposal allows for some different tradeoffs I guess ^^'! I'm actually surprised that RelationalAI and Materialize Inc haven'
570.
▲
by
j-pb
5y ago
> who? https://en.m.wikipedia.org/wiki/Daphne_Caruana_Galizia
More ›