Assignment-3 Week-3

There are two types of Unary Operation-

1. Unary operation, unary operation. These operations

(selection and projection) do not need to immediately
remember the entire relationship or most of it. Therefore,
you can read one block at a time and use the main memory
buffer to produce output.
2.
3. Perfect relationship, unary operation. Since these one-
argument operations need to display all or most of the
tuples in memory at once, the one-pass algorithm is limited
to relationships less than or equal to about M (the number
of main memory buffers available). The operations in this
class are γ (grouping operator) and δ (deduplication
operator).

Binary Operation

1. Perfect relationship, binary operation. All other operations

belong to this class: unions, intersections, differences,
bindings, product sets, and pocket versions. With the
exception of the bag union, each of these operations
requires you to limit at least one argument to size M when
using the one-pass algorithm.
External Hashing

1. The hash of the disk record is called the outside hash. In

keeping with the characteristics of disk capacity,
the goal address space comprises of buckets, with each
bucket containing numerous records. A bucket may be
a cluster of disk squares or bordering disk squares. The
hash work maps the key to a few relative bucket rather
than assigning an supreme piece address to the bucket.

2. The collision issue is less extreme with buckets since it is

feasible to hash numerous records that fit in a can into
similar container without creating issues. Be that as it may,
we have a backup in the event that where a container is
completely filled and another record is put in that can.