GitHub user yatriks created a discussion: Question about FT.SEARCH indices
Hello, I know this is a bit strange of a question, so please bear with me. Right now, to experiment with the KQIR, I'm using an index on 3 fields, `d TAG, s NUMERIC, e NUMERIC`. All my queries are range queries on `s` and `e` for a particular `d` (There are thousands of keys with `d`, all sharing a prefix). This is really fast generally, but as I'm at around ~100,000 `d`, the search command is starting to get slower. This database will likely need to be shared anyway is it grows from 100k -> 1M unique values of `d`, and I think a relatively simple `ZSET` structure would work well in that case anyway. _But for the sake of learning about the internal architecture_, I'm curious -- if I create an index per `d` with a `PREFIX`, I don't think there are any hard limitations, but architecturally what are the issues with this? What, if any, is the issue with 100k indexes that are distinct on PREFIX? 1M? Where are the technical bottlenecks? Thanks a lot for your time and help :pray: GitHub link: https://github.com/apache/kvrocks/discussions/3391 ---- This is an automatically sent email for [email protected]. To unsubscribe, please send an email to: [email protected]
