benwtrent commented on PR #14085:
URL: https://github.com/apache/lucene/pull/14085#issuecomment-2573950904
Thank you for taking a stab at this @benchaplin ! I wonder if we can adjust
the algorithm to more intelligently switch between the algorithms. something
like:
- Fan out one layer (only accepting the filtered docs) add candidates.
- If we get an acceptable "saturation" (e.g. some number <= `m*2` that we
consider adequate connectedness), we just stick to those candidates and explore.
- If we do not reach appropriate saturation fan out second layer add
candidates.
- If we fail saturation (again, some number <= `m*2`), do we fan out a
third layer? Do we "jump up" a layer in the graph to gather a better entry
point as the current one is garbage?
The initial algorithm makes sense, we are trying to recover the graph
connectedness for exploration. The bottom layer entry point is the initial
"exploration zone". One idea also is that we allow multiple "exploration zones"
from which we fan out finding the filtered values.
These are just 🧠⚡ ideas. The initial numbers are promising.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
