Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with relational-calculus
Search options answers only
not deleted
user 3035
For questions: (a) about one of the relational forms of predicate calculus, i.e., domain and tuple, or (b) about expressing queries on data contained in a relational database utilizing one of those forms of calculus.
10
votes
Find the highest graded student using Tuple Relational Calculus
Given the schema Students(id:integer,grade:integer), you can solve the problem in tuple relational calculus by using the negation operator (¬).
{T1.id | ∃T1 ∈ Students ¬(∃T2 ∈ Students (T2.grade > T1 …
- 2,358