philipl
File chunking?
Would chunking the file lead to faster results? As long as size of the start:end in pi is smaller than the chunk of the file you are looking for it would be a win and then be stored as start1:end1,start2:end2...........startN:endN. Of course once you have this long set of pairings you could run that through the same process to shrink it further.
Nice idea. I'd propose using a chunk-size that allows for pre-caching the whole range of possible adresses, like 16Bit. (2^16^2 ≈ 4Gbit optimally) Also I'd propose maybe using a special structure to dynamically save the adress of those chunks for which the size of the corresponsing adress exceeds the blocksize in chunks where it doesn't.
Drawback might be massive ammout of chunks on even small files. Possible sollution might be to dynamically use bigger chunks for bigger files, maybe only with a special archival flag since it'd use much more computational ressources.
