Skip to main content

How to Use Comparison Operators to Specify Conditions: SQL Programming

Comparison operators test whether two expressions are same or not. These operators can be used on all the sql data types except some of them like text, ntext or image. Equal to, greater then, less than are such operators. The article will let you enable to use these operators with examples.

While arithmetic operators are used to calculate column values, Comparison operators test for similarity between two expressions. You can create conditions in the SELECT statement to retrieve selected rows by using various comparison operators. Comparison operators allow row retrieval from a table based on the condition specified in the WHERE clause. Comparison operators cannot be used on text, ntext, or image data type expressions.
The syntax for using the comparison operator in the SELECT statement is:

 SELECT column_list
 FROM table_name
 WHERE expressiona1 comparison_operator expression2

  • column_list: list of fields to be shown in output.
  • table_name: from the records are to be retrieved.
  • expression1 and expression2: any expression on which the operator will be applied.
  • comparison_operator: may be one listed below.
The following SQL query retrieves records from the Employee table where the vacation hour is more than 20:
SELECT BusinessEntityID, NationalIDNumber, JobTitle, VacationHours FROM HumanResources.Employee WHERE VacationHours > 20

In the preceding example, the query retrieves all the rows that satisfy the specified condition by using the comparison operator. The result is shown in the following image:

How to Use Comparison Operators to Specify Conditions: SQL Programming

The SQL Server provides the following comparison operators.
  • =   Equal to
  • >   Greater than
  • <   Less than
  • >=   Greater than or equal to
  • <=   Less than or equal to
  • <>   Not equal to
  • !=   Not equal to
  • !<   Not less than
  • !>   Not greater than
Sometimes, you might need to view records for which one or more conditions hold true. Depending on the requirements, you can retrieve records based on the following conditions:


Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:

      Suppose next node is allocated at an address 506, so the list becomes,

  Suppose next node is allocated with an address with an address 10,s the list become,

The other way to represent the linked list is as shown below:

 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …