Questions tagged [transactions]
6 questions
2
votes
1 answer
Blockchains where new users don't need to wait for a new node to retrieve old transactions?
After watching 3b1b's brief primer on blockchains here, I noticed a bit of a "flaw" with blockchains. It isn't really a flaw, but I'm not sure how it is alleviated.
If we have two players, Alice and Bob, who are transacting with one another, each…
Andrew Baker
- 327
- 1
- 6
2
votes
1 answer
Distributed transaction problem
Let's suppose there are two banks, Bank A and Bank B. A transaction needs to happen that transfers money from an account in Bank A to an account in Bank B. Bank A and Bank B have separate banking systems which makes this transaction a distributed…
Iresh Dissanayaka
- 121
- 1
2
votes
2 answers
If a user confirmed a booking or transaction on the database system, but it failed and it falls over to the replica, what if the transaction is lost?
This is an overall system design and DBMS question:
If the user books a ticket or an item on a website, how do we solve the issue of confirming a ticket is sold to the user, but the main Database System breaks down, and the secondary DMBS doesn't…
eulerIdentity
- 21
- 2
2
votes
1 answer
Does upgrading after all locks and before all unlocks violate 2PL?
2PL's rule says:
Upgrading of lock (from S(a) to X (a)) is allowed in growing phase.
But what if upgrading lies after the last lock and before the first unlock? Does it still count "in the growing phase"? For example, is the transaction below a…
soma
- 23
- 4
1
vote
0 answers
If two schedules have the same precedence graph, then they are conflict equivalent
Let $S_{1}$ and $S_{2}$ be two schedules over the same set of transactions. If both schedules have the same precedence graph, does it follow that $S_{1}$ and $S_{2}$ are conflict equivalent.
I think the claim makes sense as -
If two schedules…
Dexter Mandark
- 41
- 5
0
votes
0 answers
Exercise task with main memory
The Exercise is
Computer A has a main memory of size HA 2 MiB, and computer B has a main memory of HB = 256 MiB. Both computers process single transactions that have a size of s=84 KiB. Each of the computers loads a maximum number of transactions…
Mete Takehara
- 1
- 1