15:[[32966412,{"by":"mikece","descendants":148,"id":32966412,"kids":[32966692,32966754,32966723,32966828,32966669,32966606,32966653,32966655,32968402,32967077,32966671,32967067,32967854,32967267,32966587,32967278,32968141,32966894,32966873,32966694,32967153,32967204,32966581],"score":206,"time":1664052399,"title":"Hertz is still having rental car customers wrongfully arrested, lawsuit claims","type":"story","url":"https://www.thedrive.com/news/hertz-is-still-having-rental-car-customers-wrongfully-arrested-lawsuit-claims"}],[32965075,{"by":"memset","descendants":57,"id":32965075,"kids":[32965563,32966204,32966717,32965513,32965989,32965562,32965688,32966410,32966333,32967523,32966825,32968454,32965618,32967519,32965163,32971509,32966861,32967624,32965665,32979261],"score":103,"text":"Are there canonical books, resources, or readings for how to design data structures that will be primarily read and written to a disk rather than memory? Most of what I learned in school about big-O assumes that, for example, random access is O(1). However, random disk reads are really slow due to spacial locality.

People who write databases obviously have solutions to this problem - for example, DuckDB is based on a number of papers that have come out over the years on this topic.

If I wanted to design, ie, a tree structure which was intended to be read/written from a disk, are there general principles or patterns the have been developed to take advantage of locality of reference, minimize random reads, or decrease the overhead of writes, that I could familiarize myself with?

What is the CLRS for disk?","time":1664042342,"title":"Ask HN: Books on designing disk-optimized data structures?","type":"story"}],[32040251,{"by":"jeffbee","descendants":253,"id":32040251,"kids":[32040472,32041149,32041299,32040519,32041031,32040468,32040446,32040714,32040431,32040358,32040423,32041382,32041679,32040476,32041245,32040330,32040408,32040414,32046689,32040514,32040460,32042298,32042715,32040564,32043286,32041470,32040395,32040386,32042294,32040392,32040567,32040461,32041078,32041484,32040543,32041456,32041958,32040753,32040362,32044627,32046653,32055013,32042293,32041109,32040554,32040443,32040501,32041071,32040884,32040697,32040689],"score":483,"time":1657408886,"title":"Help me identify possible tracking device found in my car","type":"story","url":"https://gist.github.com/jwbee/90e32362fd24b1a233b882ffa7950616"}],[31762904,{"by":"silent_speech","descendants":237,"id":31762904,"kids":[31763435,31763187,31763503,31763380,31764194,31766391,31765259,31763536,31762951,31762956,31763024,31763261,31764592,31768081,31763988,31764056,31766288,31763501,31764793,31763053,31764360,31767996,31763772,31774994,31764778,31763532,31768372,31763288,31767821,31766823,31765223,31762979,31767742,31766901,31766469,31763563,31763003,31764891,31764425,31763269,31762976,31764616,31763292,31764745,31763702,31766945,31763295,31763296],"score":667,"text":"It made the news recently that Wickr (Amazon owned E2EE chat app) is full of illegal imagery.

I read about this on my LinkedIn feed then decided to search for "Wickr" there to see who else was talking about this. The search returned dozens of spam messages offering drugs in Asia and the US with information to contact on Wickr for price.

I reported these drug spam posts to LinkedIn - which is supposedly an anonymous report.

Next day I got a flood of reports on my own comments (nothing to do with that topic), so many I didn't bother to appeal as I had other things to do. Few hours later my account was down.

Seems that for retaliation the drug network decided to find me out and use their accounts to subvert LinkedIn's policy and ensure I can't stop their spam. They have new spam up now while my account is gone.

No good deed goes unpunished I guess.","time":1655359659,"title":"Tell HN: Banned from LinkedIn for Reporting Wickr Drug Spam","type":"story"}]]

user:	dapids
created:	June 12, 2019
karma:	155
about:	Security Researcher