I looked into this indexation more closely, and the real cost is the computational cost of a linear scan of essentially the entire tx history (a subset of all taproot txs) for every query. This is the same essential problem as stealth payments had, but this is heavily parallelizable, and can complete the history scan in like 10 seconds currently. But that requires an external dependency for server. Clean C++ MIT dependency, but a dependency nonetheless. OTOH as a personal server the problem is entirely manageable on a CPU.