Skip to main content

How to Retrieve Records that contain values in Given Range: SQL Programming

Criteria is similar to a formula, a string that may consist of field references, operators and constants. We can tagged it an expression in sql programming. Sometimes this criteria have to be in range of values to let the programmer can select records within a range.

The article describes about these range operator that can access records within a given range e.g. list of students between ages 18yr to 25yr, list of employee having salary 10k to 20k. The inputted value may be a number, text or even dates. Mostly these range operator allows you to define a predicate in the form of a scope, if a column value falls in the specified scope, it got selected.

The Range operator retrieves data based on a range. The syntax for using the range operator in the SELECT statement is:

SELECT column_list
FROM table_name
WHERE expression1 range_operator expression2 AND expression3

Where

  • Column_list: list of fields to be shown in output.
  • Table_name: from the records are to be retrieved.
  • expression1, expression2, and expression3 are any valid combination of constants, variables, functions, or column-based expressions.
  • Range_operator is any valid range operator.

Here’re the range operators used in Sql programming

BETWEEN: Is used to specify a test range. It gives records specifying the given condition via sql query.
The following SQL query retrieves records from the Employee table when the vacation hour is between 20 and 50:

SELECT BusinessEntityID, VacationHours FROM HumanResources.Employee WHERE VacationHours BETWEEN 20 AND 50

How to Retrieve Records that contain values in Given Range: SQL Programming


NOT BETWEEN: Is used to specify the test range to which he values in the search result do not belong.
The following SQL query retrieves records from the Employee table when the vacation hour is not between 40 and 50:

SELECT BusinessEntityID, VacationHours FROM HumanResources.Employee WHERE VacationHours Not BETWEEN 20 AND 50

How to Retrieve Records that contain values in Given Range: SQL Programming

Retrieve records matches condition

Comments

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 …