Denis, These are 32bit, 64bit counters (essentially numbers).<br>Bob, There are well over 10K counters in the log file that are updated every 5 secs. If a counter1's graph was requested, log will have to be parsed once to get the data points. If a user asked for a counter2, now it needs to be retrieved from the log file. Which essentially means having to go through the logfile again. This is because i want to try to avoid using a database to store values after parsing the file.<br>
thanks,<br>Ravi.<br><br><br><div class="gmail_quote">On Thu, Dec 11, 2008 at 7:54 PM, bob gailer <span dir="ltr"><<a href="mailto:bgailer@gmail.com">bgailer@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div class="Ih2E3d">Ravi Kondamuru wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Reasons for C:<br>
1. The log files I am working are 60-100MB files. I *assumed* using C will reduce the parse time.<br>
2. The records themselves are variable length and hence was concerned about the complexity for implementation in python.<br>
3. Since I am not using a database, each request to refresh the graph (changing time duration for display) will have to re-parse the file all over again. And hence speed in parsing the log is important.<br>
</blockquote>
<br></div>
There should never be a need to reparse the same file. Please present the case more specifically.<div><div></div><div class="Wj3C7c"><br>
<br>
-- <br>
Bob Gailer<br>
Chapel Hill NC 919-636-4239<br>
<br>
</div></div></blockquote></div><br>