yeah, rewriting it into multiple queries with pareseable relationships between them
yeah, rewriting it into multiple queries with pareseable relationships between them
With AND what we usually want is intersection. So either directly use a DSL or a small LLM parses it out. From these we can seek intersections: simple and easy is to matrix multiply on unit vectors and filter or, use SVD (more complex but much more flexible). Geometric mean of hadamard as fallback