int[maxDoc()] + String[nTerms()] + size_of_all_unique_terms. Then double that to allow for a warming searcher.
This is great, but can you help me parse this? Assume 8M docs and I'm sorting on an int field that is unix time (seonds since epoch.) For the purposes of the experiment assume every doc was indexed at a unique time.
so.. (int[8000000] + String[8000000], each term is 16 chars + 8000000*4) * 2 that's 384MB by my calculation. Is that right?
