Top all-time · #4806
J. Andrew Rogers
Personal blog · jandrewrogers.comprogrammingsystemsdata
J. Andrew Rogers's personal blog at jandrewrogers.com covers programming, systems and data. Since 2015, 16 different Hacker News readers have linked it 22 times, most often “SpaceCurve: Unique and Fast Geospatial Database”. The last post was in 2019, but the archive is still widely read.
Too few sampled comments (11) to say how often HN recommends it.?
Why HN links it
HN readers link this blog for posts on SpaceCurve, geospatial and spatial database design, and hashing and topology. Commenters find the posts interesting and influential, and one calls the author far ahead of others.
Summarised by Claude from a sample of 11 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Most-linked posts?
- SpaceCurve: Unique and Fast Geospatial Database5 people · 6 mentions · first linked 2015-10-08
- MetroHash: Faster, Better Hash Functions3 people · 3 mentions · first linked 2015-05-27
- SpaceCurve: An Unique and Fast Geospatial Database (2015)3 people · 3 mentions · first linked 2019-05-22
- Why Are Geospatial Databases So Hard to Build?2 people · 2 mentions · first linked 2015-03-03
- Fast Perfect Hashing2 people · 2 mentions · first linked 2019-02-13
What Hacker News says?
Tip: I'd read the jandrewrogers comments before engaging. He actually does know more than you. He makes some unusual claims then doesn't back them up because he has no need to. I've spent and hour or three and learnt nothing because he's so far ahead I can't keep up. Perhaps read his profile about the amazing thing he's invented such as http://www.jandrewrogers.com/2015/10/08/spacecurve/ Let me quote a bit. I admit,…
Comment linking /2015/10/08/spacecurve/
on “Dolt is Git for Data”Submitted Why Are Geospatial Databases So Hard to Build? as a story · 183 points
HN discussionAndrew, everything you reveal publicly has been tantalizing! (See https://www.jandrewrogers.com/ for those who haven't stumbled upon his posts yet) "There is virtually no literature on practical representations of topological spaces, never mind parallel algorithms using those representations. A thorough exposition of both the theory and practice is on the order of a few hundred pages of dense technical literature th…
Comment linking /
on “Ask HN: What are you working on?”Submitted Fast Perfect Hashing as a story · 138 points
HN discussionWas skimming at your Space Curve writeup [1] and your mention of discreet internal components caught my eye. Are you open to expanding a bit on this statement: "Discrete topology internals largely obviate secondary indexing" [1]: https://www.jandrewrogers.com/2015/10/08/spacecurve/
Comment linking /2015/10/08/spacecurve/
on “Memory-Efficient Search Trees for Database Management Systems [pdf]”Submitted SpaceCurve: A Unique and Fast Geospatial Database as a story · 85 points
HN discussionIt's great to see you (jandrewrogers) of SpaceCurve reply to correctly to the question! Your blog post on why Geospatial Databases are Hard has long influenced me and a handful of others I've run into thinking about all of this. Geohashed (X+Y) points in Redis is only peripherally related to actual geospatial database concerns, particularly big-data or ("NoSQL") spatial database concerns - how do you efficiently ind…
Comment linking /2015/03/02/geospatial-databases-are-hard/
on “Redis Geo”Submitted MetroHash: Faster, Better Hash Functions as a story · 39 points
HN discussionFor example, running the sequence generator through AES rounds. This is keyed, very fast if the hardware supports it, and permutations of types smaller than the block size are collision-free and non-reversible[0] if the AES block is setup suitably. In other cases, a 128-bit key is simply encrypted (conveniently being the same block size as AES), which allows you to put arbitrary structure inside the exported key. [0…
Comment linking /2019/02/12/fast-perfect-hashing/
on “Understanding UUIDs, ULIDs and string representations”Submitted MetroHash: Faster, Better Hash Functions as a story · 15 points
HN discussionNot the OP, but googled and this was the second after LinkedIn: http://www.jandrewrogers.com/2015/10/08/spacecurve/
Comment linking /2015/10/08/spacecurve/
on “Mosaic: processing a trillion-edge graph on a single machine”Submitted Why Are Geospatial Databases So Hard to Build? as a story · 11 points
HN discussionCould you elaborate on your comment about modern spatial databases not sequentializing storage along the curve? I would imagine parallel access across the curve, but wouldn't you want some reasonable sequential access at each cluster node to maximize IO speeds? I've read your blog entries on SpaceCurve ( http://www.jandrewrogers.com/2015/10/08/spacecurve/ ), found them very interesting but also just whetting the app…
Comment linking /2015/10/08/spacecurve/
on “Z-order curve usage to decrease dimensionality to 1”Submitted AquaHash: Fast Hashing with AES Intrinsics as a story · 3 points
HN discussionYes, I remember reading your post on Metro64 at the time: http://www.jandrewrogers.com/2015/05/27/metrohash/ Interesting that you based your results there on SMHasher. Are there better benchmarks available?
Comment linking /2015/05/27/metrohash/
on “The search for a faster CRC32”Submitted SpaceCurve: Unique and Fast Geospatial Database as a story · 2 points
HN discussionTry take a look at Spatial Sieve Tree (Inventor J. Andrew Rogers) https://patents.google.com/patent/US7734714B2/en https://www.jandrewrogers.com/2015/03/02/geospatial-database... https://www.jandrewrogers.com/2015/10/08/spacecurve/ These might give a hint at why cs101 might not be enough for the scale and kind of systems he is talking about.
Comment linking /2015/10/08/spacecurve/
on “Spatial computing could be the next big thing”Submitted AquaHash: Fast Hashing with AES Intrinsics as a story · 1 points
HN discussionHi Shen - The state-of-the-art spatiotemporal database systems are based on topological embedding and geometric interval computation (hyper-rectangle cell/simplicial complex https://en.wikipedia.org/wiki/Simplicial_complex ). And while I don't know of any open-source systems based on this design, SpaceCurve is publicly available ( http://www.spacecurve.com http://www.jandrewrogers.com/2015/10/08/spacecurve/ ) , and…
Comment linking /2015/10/08/spacecurve/
on “Pyro: A Spatial-Temporal Big-Data Storage System”Submitted SpaceCurve: An Unique and Fast Geospatial Database (2015) as a story · 1 points
HN discussionThis guy talks a lot of crap. See his website for examples, and don't waste your time with him <<<There is one significant drawback that should not be understated. Algorithm design using topology manipulation can be enormously challenging to reason about. You are often taking a conceptually simple algorithm, like a nested loop or hash join, and replacing it with a much more efficient algorithm involving the non-triv…
Comment linking /2015/10/08/spacecurve/
on “Are You Sure You Want to Use MMAP in Your Database Management System?”
