The Gateway to Computer Science Excellence
0 votes
4 views
The conflict serializability can be determined by ______ of the graph containing READs and WRITEs of transactions of a schedule as vertices and READ-WRITE, WRITE-READ and ______ in the time order as edges
  1. acyclicity, READ-READ
  2. cyclicity, READ-WRITE
  3. cyclicity, WRITE-READ
  4. acyclicity, WRITE-WRITE
in Others by Boss (17.5k points) | 4 views
0
Option D

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,258 answers
198,086 comments
104,735 users