Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
martinkl
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
31.
▲
Stream processing, Event sourcing, Reactive, CEP… and making sense of it all
(blog.confluent.io)
31 points
by
martinkl
12y ago
|
6 comments
32.
▲
Wouldn't it be fun to build your own Google?
(radar.oreilly.com)
150 points
by
martinkl
12y ago
|
61 comments
33.
▲
by
martinkl
12y ago
Your first ("very unnatural") example is what I had in mind. And since read committed is the default isolation level in most RDBMS, it is prone to the lost update anomaly. (In MySQL, repeatable read is the default, but its impleme
34.
▲
by
martinkl
12y ago
Nice example of a bug caused by weak isolation. FWIW, Postgres has an interesting implementation of "serializable" which takes far fewer locks than MySQL, so may give you better performance while retaining the same isolation level
35.
▲
by
martinkl
12y ago
I don't know what behavior it "should" have. IMHO there's scope for different databases to implement things differently — otherwise there would be no room for innovation. The important thing is just that we understand pr
36.
▲
by
martinkl
12y ago
What you describe is the Lost Update (P4) anomaly. It's in the test suite: https://github.com/ept/hermitage/blob/master/mysql.md#lost-u... MySQL in repeatable read mode actually doesn't prevent
37.
▲
by
martinkl
12y ago
Awesome, I'd love a pull request! I've been looking at FoundationDB, but haven't had time to test it. Porting the tests to another database is (hopefully) a mostly mechanical exercise.
38.
▲
Hermitage: Testing the “I” in ACID
(martin.kleppmann.com)
110 points
by
martinkl
12y ago
|
33 comments
39.
▲
Moving faster with data streams: The rise of Samza at LinkedIn
(engineering.linkedin.com)
8 points
by
martinkl
12y ago
|
0 comments
40.
▲
Things I wish we had known about scaling
(martin.kleppmann.com)
19 points
by
martinkl
13y ago
|
4 comments
41.
▲
Interview with Alan Kay
(drdobbs.com)
2 points
by
martinkl
13y ago
|
1 comments
42.
▲
by
martinkl
13y ago
See also this blog post on the technology behind Intro: http://engineering.linkedin.com/mobile/linkedin-intro-doing-... https://news.ycombinator.com/item?id=6600597
43.
▲
LinkedIn Intro: Doing the Impossible on iOS
(engineering.linkedin.com)
485 points
by
martinkl
13y ago
|
306 comments
44.
▲
System operations over seven centuries
(martin.kleppmann.com)
5 points
by
martinkl
13y ago
|
0 comments
45.
▲
Improving the security of your SSH private key files
(martin.kleppmann.com)
330 points
by
martinkl
13y ago
|
101 comments
46.
▲
Schema evolution in Avro, Protocol Buffers and Thrift
(martin.kleppmann.com)
9 points
by
martinkl
14y ago
|
0 comments
47.
▲
The complexity of user experience
(martin.kleppmann.com)
19 points
by
martinkl
14y ago
|
2 comments
48.
▲
by
martinkl
14y ago
Nice. Of course the approach quickly hits a limitation if the dataset is too big to be replicated on every app server, or if low-latency updates are required. But there is wisdom in knowing what is and what isn't important in your particula
49.
▲
by
martinkl
14y ago
Rich and Nathan are really leading the thinking in this area; they are doing great stuff. But you're completely right that it is currently much easier to throw together a side-effect-ful system with frameworks like Rails. That's not surpris
50.
▲
by
martinkl
14y ago
Agree, this is going in the same direction. How models and data stores are structured will always depend on the particular application. But your point of "channeling access to the data store through only discrete paths" is very like the "se
51.
▲
Rethinking caching in web apps
(martin.kleppmann.com)
151 points
by
martinkl
14y ago
|
39 comments
52.
▲
by
martinkl
14y ago
Using pointer equality is fine, but doesn't help in the case where you have a custom equals() implementation. Maybe the JVM could inspect the implementation of equals() and spot certain patterns (e.g. it's the conjunction of equals() of a s
53.
▲
by
martinkl
14y ago
Recent versions of Ruby also use a much better hash function. Java's hash function on strings has a slightly less trivial process for generating collisions, but it's still very easy to generate enough of them to pose a DoS risk. Edit: actua
54.
▲
by
martinkl
14y ago
Interesting. But wouldn't that require keys to have an ordering (e.g. implement Comparable)?
55.
▲
Why Java's Object.hashCode() is unsafe for use in distributed systems
(martin.kleppmann.com)
72 points
by
martinkl
14y ago
|
43 comments
56.
▲
Algorithm for automatic cache invalidation
(groups.google.com)
3 points
by
martinkl
14y ago
|
0 comments
57.
▲
A robot that plays Angry Birds
(bitbeam.org)
14 points
by
martinkl
15y ago
|
0 comments
58.
▲
FounderLY interview with Martin Kleppmann of Rapportive (YC S10)
(martin.kleppmann.com)
12 points
by
martinkl
15y ago
|
0 comments
59.
▲
Rapportive, Possibly the Web's Best Lightweight CRM Tool, Gets Even Better
(readwriteweb.com)
13 points
by
martinkl
15y ago
|
0 comments
60.
▲
by
martinkl
16y ago
From what I know, success of a startup is influenced by many, many different facets. If you read something like "Founders at Work", you see that many startups were on the brink of failure at some point before later becoming wildly successfu
More ›