Earlier quoted context omitted.
DNS still runs strong and it was ~~designed~~ released* in the November 1983. It still holds up basically whole of internet. in most cases SQL is good enough for 90% of workloads.
What would DNS look like if it were released in 2025?
TigerBeetle is a most interesting database
61–70 of 228 posts
Re: TigerBeetle is a most interesting database
#62Re: TigerBeetle is a most interesting database
#63Re: TigerBeetle is a most interesting database
#64Re: TigerBeetle is a most interesting database
#65Earlier quoted context omitted.
I like to write assertions that aren't always easy to check. Like asserting that a list is sorted.
That sounds easy to check. Can you expand on this, because I don't understand.
void process_list(List aList)
in(aList.isSorted, "List must be sorted!")
do
{
// do something
}
However the O() cost of calling isSorted() has an impact on overall cost for process_list() on every call, hence why the way contracts are executed is usually configurable in languages that have them available.Re: TigerBeetle is a most interesting database
#66It's not novel. That's how hardware (ASIC) testing has been done forever. The novelty is applying it to software.
> TigerBeetle’s VOPR is the single largest DST cluster on the planet. It runs on 1,000 CPU cores
Only if you exclude hardware, otherwise basically every chip design company has a cluster bigger than this.
Re: TigerBeetle is a most interesting database
#67Earlier quoted context omitted.
>Traditional SQL databases hold locks across the network; under Amdahl's Law, even modest contention caps write throughput at ≈100–1,000 TPS In fact large real world systems are not limited to 100-1000 TPS, or even 10 kTPS as the calculator tries to suggest. That's not because Amdahl's law is wrong, the numbers you're plugging in are just wildly off, so the conclusions are equally nonsensical. There might be some spe…
Its a financial database built for use cases where this invariant holds and built for enabling new use cases where this invariant prevented businesses from expanding into new industries. The creator says as much: > Without much sweat for general purpose workloads.
But writing that traditional SQL databases cannot go above these "100-1000 TPS" numbers due to Amdahl's law is going to raise some eyebrows.
Re: TigerBeetle is a most interesting database
#68Earlier quoted context omitted.
I am quite sure Oracle and MS SQL server do just fine in multi-node cluster based architectures, but maybe that isn't their target audience.
The HN crowd does not talk much about those, but every single place I have worked used them or Postgres.
Re: TigerBeetle is a most interesting database
#69Earlier quoted context omitted.
What would DNS look like if it were released in 2025?
It would be completely centralized with a micropayment rent seeking solution to update records.
Plus micropayments, of course :-)
Re: TigerBeetle is a most interesting database
#70Earlier quoted context omitted.
I like to write assertions that aren't always easy to check. Like asserting that a list is sorted.
Then you want Design By Contract, dependent types, or formal verification. However, several factors have to be taken into account regarding performance impact when they get cleverly written, thus in manys cases they can only be fully turned on during debug builds.
It seems to be used for stuff like this, though I'm yet to really look into it properly.