Hacker Read top | best | new | newcomments | leaders | about | bookmarklet login

Sorry, I'm not talking about "number of partitions" but if I "forcibly"[0] hit the same partition, will the SLA hold?

[0] i.e. If I somehow pick keys which are on the same partition.



sort by: page size:

This makes me wonder also what happens with multiple partitions, for example:

5 into 2, 2, and 1

7 into 3, 2, and 2


Partition tolerance?

Yeah, partition size is only limited if you create a local index, because those are strongly consistent.

I wouldn’t expect either of those filters to utilize a partition key if one exists. So yeah, you probably did a full table scan every time. Is the partitioning documented somewhere?

Only if those partitions are on separate storage, otherwise you have the same number of dead tuples/dirty pages.

There's logical and physical partitions.

Logical partitions are always handled by the same physical partition. But physical partitions can handle multiple logical partitions.


Can you elaborate? What kind of partition are you referring to? Thanks.

Yeah, you're right. I threw it together really quickly, I think I'll just replace the randomized partition with a regular partition call.

Very interesting - I wasn't aware of this! Looks like this could provide a solid first cut to the partitioning process. Thanks for recommending...

Only if you want to have a single partition :( If you want to have separate ones you have to do manual dance around luks. I'd wish it was easier to set up for multiple partitions.

Is partition intolerance the only piece of the three that disproves it? I'm curious to know more about how partition intolerance is handled.

Yes, check out the Partition I 12.1 table 6 of ECMA-335 standard

Good clarification, thanks. I'm not familiar with the exact partitioning schemes of the various systems.

Ah, this is very helpful. I was aware that I wanted to do something like #2, but I was not aware that such a partitioning was the norm.

I'd imagine pretty well...until partition behavior occurs.

I don't think so. There was an encryption scheme thought up and partially implemented about a decade (or two?) ago that allowed for an arbitrary number of partitions to exist in a single encrypted drive. It was called 'rubber hose' because the scheme was designed such that it was impossible to determine how many partitions existed inside the encrypted drive.

I don't think it's a scheme that's even relevant to this context, though.

Edit: source. https://en.wikipedia.org/wiki/Rubberhose_(file_system)


That's correct. I also believe you could in theory forgo partition tolerance, it just wouldn't be a very useful system. Maybe there are use cases out there for it.

Any partitioning?

Yes, but partitioning also has a number of limitations that may be quite undesirable. Like inability to create UNIQUE constraints or primary keys, for example.
next

Legal | privacy