TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Real-Time Databases Explained: Why Meteor, Rethink, Parse and Firebase Don’t Scale

26 pointsby DivineTraubealmost 8 years ago

2 comments

dkarapetyanalmost 8 years ago
If the problem you are solving doesn&#x27;t map to being embarrassingly parallel then you will indeed have problems. This is not restricted to just &quot;real-time&quot;, or more technically streaming DBs. Coordination has high overhead no matter what DB you are using.<p>Also, I don&#x27;t see how their design avoids hot keyspace issues. Traditionally this is the main problem with partitioned designs because you move the problem one level up to properly designing the key that will be used to distribute the load across partitions.
voidmainalmost 8 years ago
This approach is &quot;scalable&quot; in the sense of partitionable, but it&#x27;s still O(N^2)! Needing 9x the servers for 3x the users is not really &quot;scalable&quot; in the colloquial sense.<p>An often more attractive approach is to partition over the keys of each database index.