Skip to main content

Database Architectures used by Database Developer: Introduction to SQL

According to earlier discussion about employee’s details storage in database, any business application can have some major elements as Single-tier Architecture, Two-tier architecture, Three-tier Architecture and at the last N-tier Architecture in context of SQL server. A database developer can easily use this concepts in sql by following below description.

Single-Tier Architecture

In single-tier architecture, all elements of a business application are combined as a single executable unit. This unit is installed on all the computers that the users need to work on. It is required to recompile and redistribute the entire application to all the computers, after any modification. That’s why it becomes complicated to modify the application or to fix any bugs.

Two-Tier Architecture

This architecture makes entry to address the problems in modifying an application faced in a first scenario. In two-tier architecture, the application is divided into two manageable parts; one part handles the data, while the other provides the user interface. The two parts can be located on a single computer or on separate computers over a network.

The part that handles the user interface (UI) is called the client tier. The part that Implements the application logic and manages the input data based on the business rules is called the server tier, as shown in the following connection.

Client Computers<---------------------------------->Database Server

Two-tier architecture is also called client-server architecture. Most RDBMSs, such as Microsoft Access, SQL Server, and Oracle adhere to the client-server architecture. RDBMS provides centralized functionality required while supporting many users.

Three-Tier Architecture

When implementing complex business solutions in case of a two-tier architecture, the tier on which the business logic is implemented becomes over loaded. As a result, it takes more time to execute. Therefore, to provide further flexibility, the two-tier architecture can be split into three tiers. In three-tier architecture, the first tier is the client tier, the second or middle tier is called the business tier and the third tier is called the server tier. The server tier contains a database server that manages the data.

Client Computers<-------->Business Tier <-------->Database Server

The business tier consists of all the business rules. It consists of the application logic that Implements rules and checks the data. The advantage of a three-tier application is that it allows you to change the business rules without affecting the other two tiers.

For instance in a banking application for loans, the user tier is the front-end, used by the customer to specify the loan details. The server tier can consist of an RDBMS in which the data is stored. The business tier lies between the other two tiers and consists of business rules, such as the loan limit and the interest rate charged to a customer. If there is a change in the rate of interest, only the middle tier component needs to be modified.

N-Tier Architecture

Comments

  1. Excellent service! Very clean and easy to use facility. Staff is very helpful too. Helped me a lot in storing my items there. Actually, I was planning to store fewer items in the storage unit., but ended up storing all my items.
    Self storage software

    ReplyDelete

Post a Comment

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 …