Nican

Taking a look at this. It looks like it only supports ICMP and UDP? https://forum.pjrc.com/threads/60532-Teensy-4-1-Beta-Test?p=...

Hello! Thanks for maintaining an open source project. I am excited to see IPFS take off.

Some basic questions, as I am still struggling to see the use case of this project.

* How did this project get started? What problem is it trying to solve?

* Are there any real world examples of where this project is used?

My usual go to is every time I write an interface, I think to myself: "How easy would it be to explain this module to another developer?"

For every additional change, I look at the module as a whole again, and keep thinking "If we got a new hire, how easy would be for the person to understand this in the bigger picture?"

Understanding is all about mindset. If part of the code starts to do too much, then other developers are likely to make incorrect assumptions of the logic behind that piece of work. The small mistakes slowly compounds over time, and if not taken care of, the whole project becomes un-maintainable.

I am trying to load the Examples [1] in CodeSandbox, and I keep getting a "Request failed with status code 403"

Any idea of what is going on here?

[1] https://github.com/tannerlinsley/react-table/blob/master/doc...

Thank you! That is useful information. I will take a closer look at Percona in the future.

I agree. I have to develop for both Angular and React for work, and I find my experience with React so much more relaxing. The logic between the what I see and what I think is straight forward. What I see is what I get. JSX is great.

Meanwhile, for Angular, I keep constantly going back to the documentation, trying to remember all the small details about templating, binding, decorators, modules, dependency injection, etc...

High-availability is always an issue that I am concerned with self-hosting MySQL or PostgreSQL. I am always worry about the fail-over failing, in case any step in the setup was not properly configured. Let me know if someone has some magical formula for easy replication.

I still find CRDB's replication interesting, since all data is replicated 3-way on every commit, and data also auto-rebalances as needed. With some exceptions, as long as you are connected to any node, you should have access to all data.

This might be related to a popular reddit thread that got 28.5k upvotes on reddit the other day: https://www.reddit.com/r/television/comments/exkrij/you_know...

Oh good. I had not seen this blog post from CRDB, and I had asked this exact question 4 months ago: https://news.ycombinator.com/item?id=21007562

+1 for relational models. All data access is relational in some way, and knowing how to efficiently access/index the data is an important step for building efficient applications.

Oh wow- I had not looked at that in detail. TLDR: Guy puts free game online, and is charged $0.30 for every download, raking up a $10k bill.

This is not even talked about: One of the biggest cost of cloud is also bandwidth. Usually at about $0.10/GB of outbound transfer.

I was thinking about the same thing. Even for a small project of 3 developers, it seems like this would rise easily to the $100+/month, for suggestions that may not even be that useful.

Probably avoid caching. Just taking a guess, but you do not want your DNS cached when the poorly-programmed router login page is trying to spoof DNS, and redirect you to their login portal.

And when I have to do incremental backups or retrieve a single file, do I have to move the whole backup from cold storage, and then back again?

ZFS does that with snapshots already. (ZFS is not encrypted, but the principle is the same)

I believe immutable trees would be the correct algorithm here.

The algorithm relies on a tree structure, where the leaves are the files. Every time a new snapshot is written, every leaf node changed writes a new path to the root node, while leaving the rest of the tree intact.

When a snapshot needs to be deleted, you just remove all the old root nodes and have a garbage-collection like-process delete all the old files.

EDIT: Look at example here: https://en.wikipedia.org/wiki/Persistent_data_structure#Tree... . When xs is deleted, nodes a,c,f can also be deleted.

EDIT2: I feel like I can never make posts like these while keeping it short and sweet, and adding enough details. ZFS can be encrypted, but accessing any files is right at its fingertips, not over a slow network connection. And there are caveats about how to encrypt the metadata, but you do not need to decrypt the whole backup to figure out what to do delete.

Glacier Storage/Cold storage, which usually takes ~6h to retrieve files, on Cloud providers are really cheap (I know Azure has $0.99/TB/month), but I have a hard time finding any free backup solutions to support the very-high latency natively.

I remember reading a long time ago that Restic was not going to natively support cold storage solutions. Has anything changed?

This is a continuation of this discussion "Fixing Getrandom()" (https://news.ycombinator.com/item?id=21114524).

I love this story, as a complete unrelated kernel commit that reduced the amount of file I/O, caused the kernel to not generate enough entropy at boot, and in consequence, made the system unbootable.

Blizzard is an old and famous game development company. Released big titles, such as World of Warcraft, Diablo, StarCraft, Warcraft, and the game that is causing the controversy: Hearthstone.

Unfortunately, this has something that has been on my backburner for a while. I do not know of any articles that fill exactly the need that I am talking about. :(

That is exactly it. Some SQL databases (CockroachDB and Postgres come to mind) can have the option of having O(1) JSON lookup. It just has to implement the correct algorithm, and index the data the correct way.

It is not about the database type. It is about the underlying algorithms and data structures.

I think part of the problem is that databases can have a mix-and-match of features, and it is hard to classify one database into a single category. I think the article does little in actually helping a developer make an informed decision about what underlying data structures actually fits best with their scenario.

To give some examples, CockroachDB both has column-families and NoSQL characteristics. A column can be specified to be a JSON column, and it can have an inverted index.

Or MemSQL has both row-based and column-based tables, and they use an unorthodox index called "skip lists".

CockroachDB and MemSQL both have different applications and characteristis, but they are just cluttered under "NewSQL", as if it was just was some kind of "SQL but better".

I am really tired of articles that talk about the different types of databases. People can make a graph databases act like relational databases, and vice-versa. Computers, in the end, are just a Turing machine. Just pay attention that the query that you are executing is actually doing the optimal solution.

I wish more time would be spent talking about the underlying algorithms that the different query languages use to accomplish the tasks. It is important for developers to understand the execution complexity of queries, and how data is distributed across a cluster.

For example, I am usually surprised when people talk about "web-scale", but they do not understand the difference between a "merge-join" and a "hash-join". Or when people do not realize that a sort requires the whole result set to be materialized and sorted.

It was not the first time I heard the requirement about "all data access happen through stored procedures", and I find it ludicrous.

Does anyone know how such a paradigm came to exist? What problem is this solving?

Can anyone speak about the benchmark posted on the blog post? Is there some fundamental difference to CockroachDB that is causing it to be that much slower? Or is it really just raw performance?

EDIT: As another note, I believe Aurora added multi-master support recently. How does that compare as well?

Read about:

https://www.cockroachlabs.com/blog/cockroachdb-on-rocksd/

https://blog.yugabyte.com/how-we-built-a-high-performance-do...

https://www.percona.com/blog/2018/04/30/a-look-at-myrocks-pe...

Quite a few databases lately are using RocksDB as their backend. Really, relational databases are just a key-value store with a well-optimized query planner on top of it.

See:

  -CockroachDB (a spinoff of Google's Spanner)
  -MySQL's MyRocks (Facebook)
  -YugaByte (Postgres compatible sharded SQL)
  -Ceph (Opensource alternative to Amazon S3)

I am guessing this is looking into improving the performance even further.

Rending all pictures at 30 frames per second, it would be a 12-hour video.

Oddly enough- The Mastadon (Open-source decentralized Twitter clone) instance that I use is also down for maintenance.

Real engineering made a video on it: https://www.youtube.com/watch?v=giQ8xEWjnBs

I recommend watching. The channel does really good explanations.