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.
VitorPamplona (nprofile…vhl6) 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..
