HNHacker News
TopNewBestAskShowJobs

storyinmemo

452 karma · joined October 27, 2015

submissionscomments
storyinmemo··on Show HN: I built a website to better compare USB-C hubs found on Amazon
What model monitor is this?
storyinmemo··on A small DIY air purifier
PM 2.5 seems to be like radiation: the more you get, the more you're likely to be affected, even at lowish levels.

https://qz.com/1166010/air-pollution-even-at-levels-that-mee...

storyinmemo··on A small DIY air purifier
This project would take 2-3 days to filter the volume of air in a 1,000 sq foot apartment... which is to say it would do nothing of significance. To be effective, you want to change the air something closer to once every 30 minutes.
storyinmemo··on 1195725856 and other mysterious numbers
Meanwhile, four years ago at Facebook :)

http://rachelbythebay.com/w/2016/02/21/malloc/

storyinmemo··on Zstandard – Fast real-time compression algorithm
The dictionary is only useful in independently compressing lots of small data chunks. Tiny files, rows in a database, VCS commits kind of things where each is independently compressed and extricable. If you tarball them so you're compressing ~100kb+, there's really no benefit to the dictionary step.
storyinmemo··on Show HN: IPpy – Parallel testing of IP addresses and domains in python
My suggestion for learning: re-write this using futures. Here's a quick example of using similar parallelism to search structured json in gzip'd files: https://github.com/autocracy/snippets/blob/master/search_clo...
storyinmemo··on Beringei: A high-performance time series storage engine
Can you elaborate on what it is that slows down your app performance? Is it bottle-necking on writing to the database? Does the database have read activity? Does the application slow down when there is read activity?

With some basic assumptions on my part including that you can have a delay in writing data to the database (since it's archival and analysis), but you don't want the application to be delayed, putting a fast queue like Kafka or RabbitMQ in place could help. It'll buffer when the database is under load, isolating your application from that.

Offline analysis might also skip the database entirely: columnar data formats (parquet) or log structured merge / sorted string tables (rocksdb) could work very well for archival or offline analysis in MR type environments.

storyinmemo··on Beringei: A high-performance time series storage engine
The paper on the algorithm is here: http://www.vldb.org/pvldb/vol8/p1816-teller.pdf

Somebody implemented the algorithm in go based on the paper here: https://github.com/dgryski/go-tsz

A short answer that may work for your question: the bits that are set in RAM are xor values relative to previous values. To provide an answer as to what the value is, a series of read|xor operations are performed.

storyinmemo··on Ask HN: What service would you pay $1k/mo for?
Yes, they move the entire cohort together.
storyinmemo··on Oracle is gunning for AWS with new infrastructure offering
They bought Nimbula back in 2013 as well: https://en.wikipedia.org/wiki/Nimbula

The naming was always confusing because both companies were based within a mile of each other, never mind the product overlap.

storyinmemo··on Facebook '2G Tuesdays' to better understand markets like India
Any employee can grab a crappy phone. Some of the Messenger crowd have 20+ phones on their desks.

Most don't stay with them for too long, though. It does really take an extra push to advance this. I had a Galaxy Young for two days after I cracked my normal phone's screen. It was kind of hellish.

← PreviousPage 3 of 3