3 ms·
I have 50 columns in a table with 10B records in a partitioned table. People can search using any combination. There are a huge number of possible composite ind
by majkinetor 2y ago
I have 50 columns in a table with 10B records in a partitioned table. People can search using any combination. There are a huge number of possible composite indexes, so we don't have any, but we have every column indexed. Most queries take a minute or two, and we also experienced a sudden drop in performance even for queries that used to work OK. Not sure what to do next to improve query speed.
- moonikakiss 2y agoThis is an interesting workload. We've heard similar pains for fast filtering on many large column tables. For this workload, having a columnstore version of your table will help. DM us: https://join.slack.com/t/mooncakelabs/shared_invite/zt-2sepjh5hv-rb9jUtfYZ9bvbxTCUrsEEA https://join.slack.com/t/mooncakelabs/shared_invite/zt-2sepj.... We can help.
- zhousun 2y agoYea this is indeed a repeated pattern we saw people requesting (filter on many columns) and we are trying to solve with pg_mooncake. If you are interested, feel free to join mooncake-devs.slack.com to chat more about your use case.