Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [precedence-graph]

A precedence graph or conflict graph or serializability graph is a graph of conflicts between transactions in a database.

A precedence graph or conflict graph or serializability graph is a directed graph of conflicts between transactions in a database. The nodes are transactions, and there is an edge $T \to T'$ if an action of $T$ precedes and conflicts with an action of $T'$.

3 questions
4
votes
2 answers

Time complexity of a precedence constrained selection problem

I wonder if you have an idea over the time complexity of the following problem, or a problem similar to this one (generally a selection problem) [Assuming operations on integers take O(1) time] We are given a set $N$ of $n$ items, that are subject…
Salim
  • 43
  • 5
3
votes
2 answers

Can you reduce a precedence graph or do *all* relevant nodes need to be connected

Let's say we have the following simple transaction-schedule: T1 | T2 | T3 -----+------+----- w(x)| | | w(x) | | | w(x) T1 comes before T2, so in the precedence graph, we draw an arrow from T1 to T2. T2 comes before T3, so…
Timon Knigge
  • 327
  • 1
  • 9
0
votes
1 answer

Preparing precedence graph from fork and join code

I was referring to this page which defines fork, join and precedence graph as follows: When the statement Fork(label) is executed by a thread of control, a second thread of control is started from the statement with the specified label. The two…
Mahesha999
  • 1,773
  • 7
  • 30
  • 45