I want to explain a technical idea - see below sentence.
After collecting the candidates and prioritizing them using one of the above methods, the sorted candidates are stored as a list of line numbers by which, the list give a similar neighbourhood list as given by the r-tree (random tree) data structure.
If I say my idea briefly in another way:
by doing it that way (the way I explained above), I can get a list which is very similar to that obtained by following r-tree (another method).
My question is, if I use by which, does this clearly describe my original idea?