4 ms·
Parsing logs 230x faster with Rust
- pentagonpapers 8y agoanytime makes the claim of hundreds of times faster with XYZ, the first implementation is almost always exceedingly naiive or done with the wrong tool. EDIT: and now that I have read the article, my dataset has grown by 1 in the "true" column
- db48x 8y agoGreat ending!
- erulabs 8y agoThis is a good post (and the regex crate in rust is _fantastic_), but I'm always a bit surprised when I find these tools were not built for general log searching and analytics, but: > What we want out of those files is incredibly tiny—a few thousand integers, labelled with names and version numbers. For example, “2018-10-25 Bundler 1.16.2 123456”, or “2018-10-25 platform x86_64-darwin17 9876”. I'm almost positive that something like Prometheus could do this just as cheaply (run a single Prometheus node on free tier EC2 with a grafana container alongside) - there would be no massive log files to parse, just integers for the desired download counts, collected regularly and viewable in near-real-time (instead of waiting for the day's log-and-parse job to be completed). I recently replaced a massively expensive "view count" system which was built using bloom filters and hadoop map-reduce with a very small piece of code that called `INCR` and `GET` against a Redis Cluster - this allowed real-time view counts, for far less money, with exponentially less log storage, massively fewer in-house lines-of-code, and an API that could not possibly be made simpler (no Java or Hadoop or AWS knowledge required) Why is it developers so badly want to parse lots and lots of access log data, rather than just increment a metric somewhere as an event happens? AWS Glue feels like a product meant for people who refuse to take a step back and think about what they're building. We also evaluated that and found it would be hilariously expensive, had poor documentation, was a brand new product, had OOM issues, and _still_ people on my team wanted to use it rather than a system actually designed for metrics in the first place.
- nostrademons 8y agoOftentimes the interesting data isn't what the metric is, but how it correlates with different user populations and actions taken. That can be as simple as knowing that all of your pageviews with zero clickthroughs happened on IE and were because clicktracking was broken on that browser. You need to store the individual events to do that sort of analysis, and once you're in that situation you run into single-source-of-truth consistency issues that strongly encourage you to store them as a log. If that's not the situation your business is in, by all means just increment a counter. It's faster, simpler, and takes much less storage space. It sounds like the RubyGems situation in the article requires new metrics to be added on request, though, and it's really handy if those can be backfilled from previous logs even if you hadn't thought to compute that metric beforehand.
- gilfoyle 8y agoThe usecase in the article was to parse logs from a CDN serving cached content not an app server which serves every request.
- erulabs 8y agoRubygems.org uses Fastly which supports streaming logs (as should any CDN worth their salt - there is no reason whatsoever to wait a whole day to download data that is by definition event-based). FWIW, Fastly CDN log streaming is exactly how I built the view-count system I mentioned above. At the end of the day a computer does a thing and counts the thing it did. Why write down what it did in a bloated format that only needs to be picked apart later?
- zerd 8y agoFrom the post it looks like that's what he does now. Fastly uploads files to S3 (you can specify how often), and then a Lambda function is run per file to aggregate the files into view-counts. How is this different from yours?
- HereBeBeasties 8y agoIt's a pretty sad state we've got ourselves into as an industry when people think that parsing a 1GB log file in three minutes is "exciting". That's five megabytes per second. Jeez, anyone would think it's 1988, not 2018. And that was an _improvement_ from the original, note - 36 minutes is 470KB per second. That is literally 1000 times slower than a modern SSD should be capable of shovelling your data. And remember, I/O is s-l-o-w. I just despair, I really do. Note that this article sweeps the cost of gzip under the carpet, which I would expect to dominate here. Try compressing with something like LZ4-HC, you'll then be able to decompress at GBs/sec of raw data.
- nostrademons 8y agoOn an economics level, the cost of storage space dominates. The cost of storing those logs with gzip -9 was $3.50/month. The cost of parsing them with Rust was free, as the parsing time fit in their Lambda free tier. The cost of parsing them with Python would've been ~$1000/month. I'd also expect gzip to dominate CPU time, but this doesn't matter much when CPU time is basically free. Sometime in the future (or today, if you're Google) it'll be important to parse logs at GB/sec. For most businesses, today, it's not really.
- dpc_pw 8y agoI share the sentiment. While the tech is getting faster and faster, our typical ways of handling data are getting worse and worse, eliminating all the gains. Devs are just tolerating slower languages, tools, architectures, methodologies etc. until a wall of some kind is being hit. "With Rust in Lambda, each 1GB file takes about 23 seconds to download and parse. That’s about a 78x speedup compared to each Python Glue worker." There should be no separate "download" and "processing". The whole thing should take exactly as much time as it takes to download the file via stream processing. Also: https://github.com/facebook/zstd https://github.com/facebook/zstd ; better ratios, better speed.
- heavenlyblue 8y agoWhen our industry hits the ceiling of scaling, then we'll start thinking about optimisation. Otherwise there are other low-hanging fruit lying around. On that matter - does anyone want to start a group that would lobby for making the computation more efficient exactly the same way the greens are lobbying to get rid of single-use plastics?
- kwillets 8y agoWhat's the grep speed?
- imtringued 8y agoWhy take such a roundabout way of solving the problem? Why dump data into a log and then parse it back? Why don't they just have a separate structured log file/database with only the information they need? "It turns out serde, the Rust JSON library, is super fast. It tries very hard to not allocate, and it can deserialize the (uncompressed) 1GB of JSON into Rust structs in 2 seconds flat." 1GB/2 seconds = 500MB/s which happens to be the sequential performance of a SATA SSD. Beyond decompressing gzipped data to then skip most of it there doesn't appear to be any performance problem at all as far as I can see.