Domain Calculus

) denotes a DRC Formula. The result of the query is set of tuples X_i to X_n which makes the DRC formula true. This language uses the same operators as tuple calculus; Logicial operators ∧ (and), ∨ (or) and ¬ (not), and we can use the existential quantifier (∃) and the universal quantifier (∀) to bind the variables. Here are examples of DRC: Let's take A,B1,C to mean Rank, Name, ID and D,E,F to mean Name, DeptName, ID Find all Captains of the Enterprise:

• { | in Enterprise ∧ A = "Captain" }

In this example, A,B1,C is the result set and a set in the table Enterprise. Find Names of Enterprise crewmembers who are in Stellar Cartography:

• { | ∃ A,C ( in Enterprise ∧ ∃ D,E,F( in Departments ∧ F = C ∧ E = "Stellar Cartography" ))}

In this example, we're only looking for the name, so denotes the column Name. F = C is a requirement, because we need to find Enterprise Crewmembers AND they are in the Stellar Cartography Department.

 

<< Previous Word Browser Next >>
paddywagon alpha reactions society of the cincinnati angraecum narmacil ii calimehtar monopodial comorbidity sarcanthinae length of stay conservative two phase locking	sizar hospital separation self modifying code bamboo curtain national health service schedule vanda music therapy susannah of the mounties eugene weidmann heather mercer	william beveridge susannah york airspeed ambassador afghanistan timeline june 2001 ferdinand iv of germany dyan cannon tommy morrison john taylor (1770 1832) brewster buffalo minnie driver matura	geena davis zebulon pike aldo leopold reference ranges for common blood tests tommy thompson nigel short pikes peak welfare state carbon burning process oxygen burning process crche