| Sort based
inversion: example |
|
|
| <a,1,2> |
|
| <b,1,2> |
|
| <c,1,1> |
|
| <a,2,2> |
|
| <d,2,1> |
|
| <b,2,1> |
|
| <b,3,1> |
|
| <d,3,1> |
|
|
|
| <a,1,1> |
|
| <a,2,2> |
|
| <b,1,2> |
|
| <c,1,1> |
|
| <b,2,1> |
|
| <b,3,1> |
|
| <d,2,1> |
|
| <d,3,1> |
|
|
|
| <a,1,1> |
|
| <a,2,2> |
|
| <b,1,2> |
|
| <b,2,1> |
|
| <b,3,1> |
|
| <c,1,1> |
|
| <d,2,1> |
|
| <d,3,1> |
|
|
|
| Initial dump |
|
| from corpus |
|
| Sorted Runs |
|
|
| Merged Runs |
|
| (fully sorted) |
|
|
|
|
| • | What’s the performance of this algorithm? |
|
| • | ||
| Saves memory but very disk intensive! |
||
