at your job.
For example in this particular product
Microsoft SQL Server, and in fact all the
products you're going to use the same
sort of mechanism.
But you can explain a query and that will
give you access to some form of this
algebra that I've been talking about.
Okay, so if you take a query and here,
I've changed the scheme yet again.
This table, this Reuters is one you'll be
working with in the homework.
I ran a query here and I've explained it
in what shows what the sequel management
studio gives back to me is a little
algebraic tree, kind of like the ones
I've been drawing here, just, you know,
in PowerPoint.
Okay, and so this one says, a hash mash
is going to be used to implement this
joining conditions.
This one's kind of a complicated joining
condition, for a reason I'm not going to
explain right now.
But it has two leaves, and they did join
with this thing called a hash mash inter
join.
Okay, so this very much like the hash
table example I gave on the previous
slide.
But, I want you to take a look at
something.
So here I've taken the exact same query,
but I've added an extra condition where
I'm only looking for words equal to
parliament.
I probably should explain this scheme a
little bit.
So the Reuters set gives you term
frequencies.
You have three columns, doc ID, or let's
just say doc, term, and frequency.
How, and the frequency is how often that
term appears in that document.
Okay?
And so this is the, the table you'll be
looking at.
Right.
And so here what I've said is, I'm
looking for pairs of terms that that that
co occur in a single document, is the, is
the previous query I was looking at.
And now I've said, well look, I don't
want all pairs of document, or all pairs
of terms, I only want terms that co-occur
with the term parliament.
Right so perhaps a lawyer, a co-occurs
with parliament frequently.
So I'm looking for all the, all the terms
co-occur in some document with parliament