Re: [logs] Faster unix 'sort' replacement?

Previous message: Mike Blomgren: "[logs] Faster unix 'sort' replacement?"
In reply to: Mike Blomgren: "[logs] Faster unix 'sort' replacement?"
Next in thread: Ed Schmollinger: "Re: [logs] Faster unix 'sort' replacement?"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

mjr@private

Mike Blomgren wrote:
>I'm using sort in the standard 'cat <file> | awk '{"compute..."}' | sort |
>uniq -c | sort -n -r' type analysis.

You might want to just use a Btree or something that auto-sorts.
It depends on the amount of data you're managing.

BUT - take a look at "NBS" - basically it is designed to do
_exactly_ the
sort | uniq -c | sort -n -r
pipeline, with built-in persistence and a bunch of other
goodies. Just use the NBS database and throw away
the output NBS (-o /dev/null) and then use nbsdump to
output the topN values.
http://www.ranum.com/security/computer_security/code

mjr. 

_______________________________________________
LogAnalysis mailing list
LogAnalysis@private
http://lists.shmoo.com/mailman/listinfo/loganalysis