ayende

9 ms·

61.
by ayende 3y ago
https://ayende.com/blog
62.
by ayende 3y ago
I am using the same rough model, and I'm using that on a 1.5 TB db running on Raspberry PI very successfully. Pretty much all storage libraries written in the past couple of decades are using single writer. Note that single writer does
63.
by ayende 3y ago
That is absolutely not what you actually get from the hardware. For fun, there is no guarantee in terms of writing a page in what order it is written. SQLite documents that they assume (but cannot verify) that _sector_ writes are line
64.
by ayende 3y ago
It's more than that. Consider Apple's strongest advantage, it's brand. If Goldman is the one handling the lending, it is also the one sending you to collections. The PR damage to Apple's brand can be significant
65.
by ayende 3y ago
Huge hassle regarding taxes, legal details, etc. For example, if you hired someone in Israel, you are mandated to pay taxes, contribute to pension plan, etc. There are labor laws details that you need to know how to work through, etc. As a
66.
by ayende 3y ago
Am I missing something? I thought the nonce had to just be non repeating, didn't have to be a secret.
67.
by ayende 3y ago
AGPL will do that, no GPL GPL on server side software doesn't really matter, that is why the AGPL exists
68.
by ayende 3y ago
It's very rare that you are able to just ingest data in a serial fashion For most scenarios, you need to jump between locations Think an index, reading different files, etc. Then the latency dominates
69.
by ayende 3y ago
Banwidth != latency, however. A truckload of TB disks will give you awesome bandwidth by driving it around to the destination. The latency of a particular call, however, wouldn't make it usable. Memory is hierarchical, but any latency
70.
by ayende 3y ago
Using _ftruncate_ or FALLOC_FL_ZERO_RANGE is a bad idea for a database. The problem is that you may get an out of disk space error mid operation. If you are using mmap, that will express itself as a segmentation fault, which you really do
71.
by ayende 3y ago
The issue is that fsync is super expensive. Like, it's not even funny. There are many cases, and ingest is one of them, where no being durable is fine. If you can either: * Repeat the whole process on failure (which is assumed to b
72.
by ayende 3y ago
I wrote a response to this article, because that is a bad comparison. https://ravendb.net/articles/re-are-you-sure-you-want-to-use... Agree on CMU being a great resource.
73.
by ayende 3y ago
A better option here would be to use `_mm_movemask_epi8`, for the vector: ``` { false, false, false, false, true, false, false, true } ``` It will give an int with the bits: `0b0000_1001` You can then do `@clz` to get the index of the first
74.
by ayende 4y ago
I'm using paid Google account, so I'm getting that this isn't available. Makes sense, I'm already a customer, no reason to keep me as such, right?
75.
by ayende 4y ago
Here are good examples of the problem: https://www.reddit.com/r/archlinux/comments/pjcnh0/power_out... https://unix.stackexchange.com/questions/453074/power-loss-w... https:&#
76.
by ayende 4y ago
To give context, what happens if you lose power midway through? One of the things Windows will do is first lay out the work to revert all changes in that happens (across potentially thousands of files). It also need to flush them to disk (v
77.
by ayende 4y ago
Just for refence. C and non flat memory model used to be REALLY common. It was called MS-DOS, and Win16 https://stackoverflow.com/questions/8727122/explain-the-diff...
78.
On AI, GPT and the future of developers(ravendb.net)
1 points by ayende 4y ago|0 comments
79.
by ayende 4y ago
Except that then you have a list of common phrases that you can check. How many passpharses would be: "in god we trust" or "I love you". Figure out song titles and book titles, and you have a great list to check. See als
80.
by ayende 4y ago
That was interesting to read. RavenDB does something similar, if there isn't an index for the query, it will create one for you. The difference is that this is a persistent structure, which is reused across multiple queries and invocat
81.
by ayende 4y ago
That assumes that the application even know to check the "only valid if issued before" flag.
82.
by ayende 4y ago
There is no API to actually handle trust. If you are asking `curl` or `openssl` to verify the chain, it needs to read it from somewhere. By convention, there is `OPENSSLDIR`, for example. But that just tells us where the root certs are, not
83.
by ayende 4y ago
This is a horrible implementation. To start with, this queue isn't concurrent. It has a lock (and make it easy to leak / stall) with it. Second, it has a `O(N)` performance on inserts. This is beyond unexpected for something that
84.
by ayende 4y ago
You actually are doing dynamic memory allocations, you are just not allocating from the operating system. A quick look shows how this is done: https://github.com/tigerbeetledb/tigerbeetle/blob/91a105875c...
85.
by ayende 4y ago
RavenDB can do that
86.
by ayende 4y ago
In Israel, for example, a lot of land is not "sold", but leased by the state to people. In practical terms, there is no real difference. Technically speaking, the lease terms are 49 / 98 years. The problem is that when you re
87.
by ayende 4y ago
What would this "penalize" US court look like? And what do you think the US reaction to something like that would be?
88.
by ayende 4y ago
I think that this is going to further the reputation damage for trusting Google with anything. The fact that this was handled on such short notice is a huge problem, but who is going to want to invest in another Google technology with such
89.
by ayende 4y ago
You are off by a couple of orders of magnitude I have run 500+ req/sec on a raspberry pi using 4 TB dataset with 2 GB of RAM, with under 100ms for the 99.99 percentile A few hundreds req a second is basically nothing.
90.
by ayende 4y ago
You don't

More ›