"Rockstar work, efficient search is key to decoding health truth"

You are dead on as far as i can tell. Im not nearly as credentialled as either of you, but ive been working on what im sure is a comparatively primitive search and the asynchronicity of it all makes it so hard to get the best results at the top quickly.

I'm sure you're beyond me. I've usually just done bare manual SQL searching on a good size data lake and performance can really care about exactly how you do things. I do have a very little good abstract knowledge from the first few lectures of the old MIT 6.001 using the wizard book. GREAT comp sci intro. @Vitor Pamplona you know what the asymptotic growth is? I'd assume no matter what you're doing this has gotta be complex. The lecture on tree recursion comes to mind when enumerating Fibonacci numbers and the number of Nostr relays dizzies me..

It's complex but not that much... It just takes a few relays as inputs, downloads all events from them, collects all references to other relays and keeps growing the list of relays to check. Then it just dedupes by ID. Takes about 1hr to generate the report with about 2.5M events.

Hmm probably is O(n) then. Guess no need to do any elaborate cross indexing. Of course, with all the zaps on comments on likes on zaps on commments on likes...it could still get silly.