| ▲ | Do we still have to denormalize? Have your schema and search it too(paradedb.com) | |||||||
| 42 points by philippemnoel 3 days ago | 5 comments | ||||||||
| ▲ | gopalv an hour ago | parent | next [-] | |||||||
> Instead of joining the tables completely and sorting at the end, a Rank Join streams its inputs in descending score order (sorted access, or SA), building candidate result-sets as it goes. Your algorithm feels like a variant of the WAND algorithm the Snowflake Top-K pruning paper [1] pulls from. You can go distributed with this approach if you have a "gossip" protocol between workers to distribute the heap boundaries periodically. Before the AI age, a "papers we love" group was a great thing within any company. Now, Claude or Codex will know the SOTA literature around a topic like this and "uniformly distribute" the past into every single implementation of a similar idea. The future isn't uniformly distributed, but the past is getting the treatment & that's good. | ||||||||
| ||||||||
| ▲ | anon373839 24 minutes ago | parent | prev | next [-] | |||||||
ParadeDB is the best! I really like the Django integration (https://github.com/paradedb/django-paradedb). You get proper BM25 scoring, fuzzy matching, hybrid search, metadata filtering while still just using QuerySets. And you're keeping everything in Postgres, so there isn't any need to manage or sync a separate DB/search engine. | ||||||||
| ▲ | jamesgresql an hour ago | parent | prev | next [-] | |||||||
Any questions please go for it, ParadeDB team is watching. | ||||||||
| ▲ | dan_thinks 3 hours ago | parent | prev [-] | |||||||
This looks exciting for some searches (top k), but the headline doesn't really fit. Yes - we still have to denormalize. Just not for some of the use cases paradedb targets. Impressive work. | ||||||||