Adrien Grand created LUCENE-6469:
------------------------------------
Summary: Make SortingLeafReader sort postings lists more
efficiently
Key: LUCENE-6469
URL: https://issues.apache.org/jira/browse/LUCENE-6469
Project: Lucene - Core
Issue Type: Improvement
Reporter: Adrien Grand
Assignee: Adrien Grand
Priority: Minor
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
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
