|
|
Posted by Steve on 09/21/05 19:27
> I haven't tried it yet, but I was figuring I could maybe unpack the
> whole thing or partrs of it at a time into hex and then search it from
> there.
Maybe you can get away with that but your performance could be
dreadful. You'd have to deal with searching across part boundaries,
sliding windows and all that jazz. But you will have to decide whether
to optimise execution time, or storage cost, or memory use, or
compromise on everything. What is your main constraint? Space on disk,
memory, execution time or complexity of algorithm?
Could be that I'm underestimating the resources you have: on my desktop
even a brute force search (strpos) is reasonably fast against an 8M
string, and preg_match is faster. However I haven't looked at what this
is doing to my resources. Your server might buckle under a heavy load
if searching in pi becomes the Next Big Thing.
---
Steve
Navigation:
[Reply to this message]
|