Skip to main content

Computer Memory Measurement

Units of Computer Memory Measurement

Units of Computer Memory Measurement
(Image by - Sharma Guides | Subham232330)


1Bit = Binary Digit

8Bits = 1 Byte

1024 Bytes = 1KB (Kilo Byte)

1024 KB = 1MB (Mega Byte)

1024 MB = 1GB (Giga Byte)

1024 GB = 1TB (Terra Byte)

1024 TB = 1PB (Peta Byte)

1024 PB = 1EB (Exa Byte)

1024 EB = 1ZB (Zetta Byte)

1024 ZB = 1YB (Yotta Byte)

1024 YB = 1 Bronto Byte

1024 Brontobyte = 1 Geop Byte



Labels:

Comments

Post a Comment

Please do not enter any spam link in the comment box.

Popular posts from this blog

Joins in DBMS

DBMS Joins: Inner, THETA, Outer, Equi Types of Join Operations Join in DBMS is a binary operation that allows you to combine join product and selection in one single statement. The goal of creating a join condition is that it helps you to combine the data from two or more DBMS tables. The tables in DBMS are associated using the primary key and foreign keys. Types of Join There are mainly two types of joins in DBMS: Inner Joins: Theta, Natural, EQUI Outer Join: Left, Right, Full Inner Join Inner Join is used to return rows from both tables which satisfy the given condition. It is the most widely used join operation and can be considered as a default join-type An Inner join or equijoin is a comparator-based join which uses equality comparisons in the join-predicate. However, if you use other comparison operators like “>” it can’t be called equijoin. Inner Join further divided into three subtypes: Theta join Natural join EQUI join Theta Join Theta Join allows you to merge two tables ba...
Post a Comment
Read more

Indexing in DBMS

Indexing in DBMS Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed.  The index is a type of data structure. It is used to locate and access the data in a database table quickly. Index structure: Indexes can be created using some database columns. The first column of the database is the search key that contains a copy of the primary key or candidate key of the table. The values of the primary key are stored in sorted order so that the corresponding data can be accessed easily.  The second column of the database is the data reference. It contains a set of pointers holding the address of the disk block where the value of the particular key can be found. Indexing Methods Ordered indices The indices are usually sorted to make searching faster. The indices which are sorted are known as ordered indices. Example: Suppose we have an employee table with thousands of record and each of which is 10 byte...
Post a Comment
Read more

Relational Calculus

Relational Calculus There is an alternate way of formulating queries known as Relational Calculus. Relational calculus is a non-procedural query language. In the non-procedural query language, the user is concerned with the details of how to obtain the end results. The relational calculus tells what to do but never explains how to do. Most commercial relational languages are based on aspects of relational calculus including SQL-QBE and QUEL. Why it is called Relational Calculus? It is based on Predicate calculus, a name derived from branch of symbolic language. A predicate is a truth-valued function with arguments. On substituting values for the arguments, the function result in an expression called a proposition. It can be either true or false. It is a tailored version of a subset of the Predicate Calculus to communicate with the relational database. Many of the calculus expressions involves the use of Quantifiers. There are two types of quantifiers: Universal Quantifiers: The univer...
Post a Comment
Read more