3 ms·
I've never had the use case for this amount of throughput. What are use-cases for this. From the website I presume this is gene-matching related?
by nielsole 2y ago
I've never had the use case for this amount of throughput.
What are use-cases for this. From the website I presume this is gene-matching related?
- curiouscoding 2y agoJup. I've added to the future work section now that the plan is to use this to speed up suffix array searching. Suffix arrays are pretty regularly used to build indices over say a human genome, that can then be queried. And since DNA sequencers are still increasing there throughput and accuracy, it's always good to have faster algorithms as well.
- marginalia_nu 2y agoI'm using a variant of static search trees in my search engine index though in this scenario the main bottleneck is block reads from disk, but the thinking is relatively similar to cache lines. Use case is to query hundreds of gigabytes of data in tens of milliseconds. (Skiplists is also used by some search engines.)
- Bulat_Ziganshin 2y agoJOIN SQL operation is another usecase