Make SortingLeafReader sort postings lists more efficiently [LUCENE-6469]
Open
legacy-jira-priority:Minor
type:enhancement
- Dominant language
- Java
- Stars
- 3.6k
- Forks
- 1.4k
- Avg merge
- 2d 11h
- Merged PRs (30d)
- 88
Description
We could use a bit set to sort postings lists (similarly to BS1) instead of loading the postings list to an int[] and then sorting them using TimSort. I'm not totally clear whether it would be faster or slower but at least it would have a better worst-case memory usage.
See http://search-lucene.com/m/l6pAi1e8sh52n8Uts/sortingatomicreader&subj=Re+SortingAtomicReader+alternate+to+Tim+Sort+ for more information
---
Migrated from [LUCENE-6469](https://issues.apache.org/jira/browse/LUCENE-6469) by Adrien Grand (@jpountz)
Contributor guide
Assessment
This issue has not been assessed yet.