This message was deleted.
# troubleshooting
s
This message was deleted.
g
the best way is to do a test load and see how much space it takes up; compression can vary based on the dataset
a good rule of thumb is druid data is generally going to be slightly larger than parquet
so if your original is parquet you can use, like, 20–30% more than that as an estimate? (that will vary too; in both directions; so a test load is still useful)
note that the compression is improving soon due to https://github.com/apache/druid/pull/12277
will still be somewhat larger than parquet (we do have extra indexes, etc that parquet does not have) — but not as much larger as today
a
All great points by Gian. I will also point out that data locality matters too. Depending on how you are ingesting the data, you should use range partitioning (automatic if you are using SQL based ingest). https://imply.io/blog/multi-dimensional-range-partitioning While I have not directly verified this, range partitioning would make the dictionary compression (that Gian linked), even more effective. Because the dimensions with similar values are going to land in the same segment and the compression algorithm does much better when the values are similar. Dictionary compression is going to be available in 25.0 which is just around the corner.
c
Brilliant! Thank you both very much for the valuable information!