Viewing profile — boyd

Throwing cores at the problem with `pytest-xdist` is typically the lowest hanging fruit, but you still hit all the paper cuts the authors mention -- collection, DB fixtures, import…

I think we're somewhat talking past one another -- in any case, we'll add more in the README on minimal perfect hash functions and the differences. In short, you'd need to also hav…

> PTHash and other minimum perfect hash functions return an arbitrary value if the query key did not exist when building the MPHF, so they can be a lot smaller. B-field can identif…

... meaning it is an "injective" function that maps unique key-value pairs, correct? Genuinely asking, I have glancing familiarity via their use in assembly algorithms but (a) don'…

My understanding is that a perfect hash function maps elements elements to a unique integer (i.e., it's a one-to-one mapping). I think PHF data structures will also always return a…

So a bitmap index requires a bit per unique value IIRC (plus the key and some amount of overhead). So for ~32 unique values you're already at 4 bytes, 40 bytes per key-value pair f…

Thank you! The "Space Requirements" section in the README has a few examples, and your comment has made me realize our (micro-)benchmark link in the README is broken. We'll get tha…

> So it’s for cases where you have any key but associated with one of only (preferably few) discrete values We use it for a case with ~million unique values, but it's certainly mor…

Ah, we need to clarify the language! The B-field will always return the correct value for an inserted key. False positives are only returned for keys that have not been inserted. T…

Yes you can manage the error rate by controlling the overall size of the allocated bit array and several other parameters. There's a (slightly obtuse) section on parameter selectio…

I think those are both good examples of where you can manage the cost of a false positive. In genomics, we're using this to map a DNA substring (or "k-mer") to a value. We can tole…

`rust-bfield` is a Rust implementation of our novel "B-field" data structure, which functions like a Bloom filter for key-value lookups instead of set membership queries. The B-fie…

We’re more focused on data visualization vs. general “chat with your data”, but building in this space: https://minard.ai Upload or import a CSV, Excel, Google sheet, etc. and also…

It looks like on mobile in portrait that link isn’t showing up in the header. Thanks for flagging! We’ll get that fixed, but in the meantime the direct login link is https://minard…

Hi HN – Excited to share a beta for Minard, a new data visualization toolkit we've been working on that lets you generate publication-quality charts with simple natural language (t…

It’s fairly common to use two hash functions and then compute the remaining n hashes as hn(x) = h1(x) + n * h2(x). Paper: https://link.springer.com/chapter/10.1007/11841036_42

Feel obliged to point out this is misleading / not especially relevant: GDP is the value of the annual output of a country, while market capitalization is the (discounted) value of…

I was looking at this a while back and it was difficult/tedious at the time (and I think also not supported on Amazon EKS). Has it gotten better? Any resources you recommend? Curso…

Futons are neither good couches nor good beds.

One Codex (YC S14) | San Francisco (Mission) | Software + Scientist Roles | Onsite + Remote | https://www.onecodex.com One Codex is a platform for microbial genomics. We are a tech…